Method and apparatus for outline font character generation in dot matrix devices

• US 5,355,449 A
• Filed: 09/30/1991
• Issued: 10/11/1994
• Est. Priority Date: 09/30/1991
• Status: Expired due to Term

• Current Assignee: Primax Electronics Limited
• Original Assignee: Destiny Technology Corporation (Primax Electronics Limited)
• Inventors: Lung, James C. Y., Ruby, Gary, Lo, Jim C. K.
• Primary Examiner(s): Herndon, Heather R.
• Assistant Examiner(s): Smith, Michael
• Application Number:
  US07/771,382
• Time in Patent Office: 1,107 Days
• Field of Search: 395/150, 395/151, 395/149, 395/139, 340/730, 340/731, 345/143, 345/144, 382/22, 382/25
• US Class Current: 345/467
• CPC Class Codes: G06K 15/02 using printers
• CPC Class Codes: G06K 2215/0045 Converting outline to bitmap
• CPC Class Codes: G06T 11/203 Drawing of straight lines or curves
• CPC Class Codes: G09G 5/24 Generation of individual character patterns

Abstract

Method and apparatus for outline font character generation in dot matrix devices including a point transform engine, a parametric equation generator, an adaptive forward differencing engine, a transition detection engine, a transition processor, an intermediate storage, and a bitmap converter. The point transform engine performs a linear transformation on the input control points to produce a set of control points corresponding to the description of the scaled image. The parametric equation generator computes a set of coefficients used in generating polysegments. The adaptive forward differencing engine generates a set of controlled length vectors representing the image, while the transition detection engine determines the transition pixels by scanning the vectors both horizontally and vertically to determine whether a scanline is crossed by the vector. The transition processor enhances the image quality and alters the number and location of the previously determined transition pixel. The transition locations for the image are accumulated in the intermediate storage until all curves of the image have been processed. The bitmap converter converts, on a line-by-line basis, the transition information into bitmap format.

Claims

1. Apparatus for converting an outline font represented by a control point stream into bit mapped data suitable for driving dot matrix display devices, comprising:

point transform means responsive to said control point stream and operative to generate a transformed point stream;

flattening means responsive to said transformed point stream and operative to generate a set of normalized polysegments defined by end point data wherein the length of each polysegment has a predetermined relationship to the dimensions of a pixel to be printed or displayed;

transition detection means responsive to said normalized polysegments and operative to develop a set of flag signals and initial transition pixel data locating a transition pixel relative to each polysegment intersected by a reference line passing through a particular point of each pixel in a row of pixels, a transition pixel being defined as a pixel at which a data state transition occurs;

intermediate storage means for storing transition pixel data;

transition processing means responsive to the transition pixel data developed by said transition detection means, a plurality of process parameters, and said set of flag signals, and operative to compare said initial transition pixel data to transition pixel data previously stored in said intermediate storage means and to generate intermediate transition pixel data for return to said intermediate storage means;

bitmap converter means responsive to said stored intermediate transition pixel data, and operative to generate bitmap data; and

output means responsive to said bitmap data and operative to generate output character data corresponding thereto.

2. Apparatus as recited in claim 1 wherein said flattening means includes:

parametric equation generator means responsive to said transformed point stream and operative to generate a plurality of polynomial coefficient values; and

segment generation means responsive to said coefficient values and operative to generate said set of normalized polysegments.

3. Apparatus as recited in claim 2 wherein said parametric equation generator means includes:

input register means for storing a data stream including one of said transformed point stream communicated from said point transform means, and an interim value;

means for shifting said data stream stored in said input register means by a predetermined value to generate shifted data;

temporary register means for storing registered data including one of said shifted data and said interim value;

adder means for adding said shifted data with data stored in said temporary register means to generate said interim value;

equation generator sequence control means for generating a process stop signal; and

output register means responsive to said process stop signal and operative to receive said interim value and store same as said coefficient value.

4. Apparatus as recited in claim 1 wherein said point transform means includes:

scaling input register means for storing a plurality of predetermined scaling factors;

control point input register means for storing a portion of said control point stream;

multiplier means for receiving said predetermined scaling factors and said portion of said control point stream, and for multiplying said predetermined scaling factor with a control point in said control point stream to generate an intermediate value stream;

adder means for adding said intermediate value stream with a previously accumulated sum value to generate said transformed point stream; and

control point output register means for storing said transformed point stream.

5. Apparatus as recited in claim 1 wherein said transition processing means includes:

input register means for storing said transition pixel data said transition pixel data including X coordinate value, Y coordinate value and transition information;

tile test means responsive to said Y coordinate value and operative to compare said Y value to predetermined limit values and to generate a tile test flag value;

stub test means responsive to said Y coordinate value, and to said X coordinate value, and operative to compare said X and said Y values to previous X and Y values and to generate a stub test flag value and to store the current X and Y values;

first coordinate adder means for adding said Y coordinate value with a Y offset value;

second coordinate adder means for adding said X coordinate value with a X offset value; and

sequence controller means responsive to said Y coordinate value, said X coordinate value, said tile test flag value, said stub test flag value, said set of flag signals including a Y transition flag, said process parameters and intermediate transition pixel data previously stored in said intermediate storage means, and operative to generate said Y offset value and said X offset value, read and write instructions for controlling the intermediate storage means, and to output the current intermediate transition pixel data for return to the intermediate storage means.

6. Apparatus as recited in claim 5 wherein said tile test means includes:

first limit comparator means for comparing said X coordinate value with a predetermined upper value, and operative to generate an upper limit test flag value indicating that the Y coordinate value is less than said upper value;

second limit comparator means for comparing said X coordinate value with a predetermined lower value, and operative to generate a lower test flag value indicating that the Y coordinate value is not less than said lower limit; and

limit selector means responsive to said upper test flag value and said lower test flag value, and operative to generate said tile test flag value when said Y coordinate value is less than said upper limit and equal or greater than said lower limit.

7. Apparatus as recited in claim 5 wherein said stub test means includes:

a first register for storing X and Y coordinate values of the last X transition;

first comparator means for comparing current X and Y coordinate values with stored last X transitions X and Y coordinate values, and operative to generate an X stub flag value;

a second register for storing X and Y coordinate values of the last Y transition;

second comparator means for comparing current X and Y coordinate values with stored last Y transitions X and Y coordinate values, and operative to generate a Y stub flag value; and

coordinate selector means responsive to said Y transition flag and operative to select said X stub flag value when said Y transition flag is of a first state and to load current X and Y coordinates into said first register, and to select said Y stub flag value when said Y transition flag is of a second state and to load current X and Y coordinates into said second register.

8. Apparatus as recited in claim 1 wherein said bitmap converter means includes:

even odd converter means responsive to said stored intermediate transition pixel data, and operative to generate an even odd bitmap data stream;

non-zero converter means responsive to said stored intermediate transition pixel data, and operative to generate a non-zero bitmap data stream;

first selection means responsive to a first bitmap select signal operative to select one of said even odd bitmap data stream and said non-zero bitmap data stream for use as an interim bitmap data stream;

temporary register means for storing said interim bitmap data stream;

patching logic means responsive to said interim bitmap data stream and said stored intermediate transition pixel data, and operative to generate a patched bitmap data stream;

second selection means responsive to a second bitmap select signal operative to select one of said patched bitmap data stream and said interim bitmap data stream for use as bitmap data;

bitmap register means for storing said bitmap data; and

bitmap control means responsive to said stored intermediate transition pixel data to generate said first bitmap select signal, and said second bitmap select signal.

9. Apparatus as recited in claim 8 wherein said non zero converter means having:

adder/subtracter means responsive to said stored transition word, and a count signal, and operative to generate a new count signal, and said non-zero bitmap data stream;

non-zero remainder means responsive to said new count signal and operative to generate said count signal.

10. A method of converting an outline font represented by a control point stream into bit mapped data suitable for driving dot matrix display devices, comprising the steps of:

converting said control point stream into a transformed point stream;

using said transformed point stream to generate a set of normalized polysegments wherein the length of each polysegment has a predetermined relationship to the dimensions of a pixel to be printed or displayed;

using said normalized polysegments to develop initial transition pixel data including transition address information and flag signals locating a transition pixel relative to each polysegment intersected by a reference line passing through a particular point of each pixel in a row of pixels, a transition pixel being defined as a pixel at which a data state transition occurs;

using a plurality of process parameters to compare said initial transition pixel data to previously stored corresponding transition pixel data to generate intermediate transition pixel data;

storing said intermediate transition pixel data;

using said stored intermediate transition pixel data to generate bitmap data; and

using said bitmap data to generate output character data corresponding thereto.

11. A method as recited in claim 10, wherein said step of converting said control point stream includes the steps of:

storing a plurality of predetermined scaling factors;

storing a portion of said control point stream;

multiplying said predetermined scaling factors with coordinates of a control point in said control point stream, to generate an intermediate value stream;

adding said intermediate value stream to a previously accumulated sum value to produce said transformed point steam; and

storing said transformed point stream.

12. A method as recited in claim 10, wherein said step of using said transformed point stream includes the steps of:

using said transformed point stream to generate a plurality of polynomial coefficient values; and

using said coefficient values to generate said set of normalized polysegments.

13. A method as recited in claim 10 wherein said step of using said stored intermediate transition pixel data includes the steps of:

reading said stored intermediate transition pixel data;

converting said stored intermediate transition pixel data to an even odd bitmap data stream;

converting said stored intermediate transition pixel data to a non-zero bitmap data stream;

selecting one of said even odd bitmap data stream and said non-zero bitmap data stream, for use as an interim bitmap data stream;

storing said interim bitmap data stream;

patching said interim bitmap data stream with said stored intermediate transition pixel data to generate a patched bitmap data stream;

selecting one of said patched bitmap data stream and said interim bitmap data stream, for use as bitmap data; and

storing said bitmap data.

14. A method as recited in claim 10 wherein said step of using said transition pixel data includes the steps of:

(a) reading said transition pixel data, wherein said transition pixel data includes a current slope value corresponding to the slope of a polysegment generating said transition pixel data, a current transition bit signal, and a current transition address signal;

(b) reading said stored transition word, wherein said stored transition word includes a previous slope value corresponding to the slope of a polysegment generating said transition word, a previous transition bit signal, and a previous transition address signal;

(c) reading said process parameters, wherein said process parameters are made up of a dropout protection signal, a non-zero processing signal, and a vertical scan signal;

(d) comparing said transition pixel data with said stored transition word;

(e) determining if said dropout protection signal is set to a second flag signal and said non-zero processing signal is set to a second flag signal then generating said final transition pixel data wherein said final transition pixel data includes a final transition bit signal, a current slope value corresponding to the slope of a polysegment generating said final transition pixel data, and a final transition address signal, and wherein said final transition address signal is equal to said current transition address signal of said transition pixel data;

(f) determining if said dropout protection signal is set to said second flag signal and said non-zero processing signal is set to a first flag signal then

(1) determining if said current transition bit signal is equal to said previous transition bit signal then

(a) if said current slope value and said previous slope value are not identical then generating said final transition bit signal to a "0",

(b) if said current slope and said previous slope value are identical then setting said final transition address signal to previous transition address signal and setting said previous transition address signal to a predetermined bias value,

(2) determining if said current transition bit signal is not equal to said previous transition bit signal then generating said final transition pixel wherein said final transition address signal is equal to said current transition address signal of said transition pixel data;

(g) determining if said dropout protection signal is set to said first flag signal and said non-zero processing signal is set to said second flag signal then

(1) determining if said current transition bit signal is equal to said previous transition bit signal then setting said final transition address signal to previous transition address signal and setting said previous transition address signal to a predetermined bias value,

(2) determining if said current bit signal is not equal to said previous transition bit signal then generating said final transition pixel data wherein said final transition address signal is equal to said current address signal of said transition pixel data; and

(h) determining if said dropout protection signal and said non-zero processing signal are both set to said first flag signal then

(1) determining if said vertical scan signal is set to said first signal flag then setting said final transition address signal to previous transition address signal and setting said previous transition address signal to a predetermined bias value,

(2) determining if said vertical scan signal is set to said second signal flag then

(a) if said current slope value and said previous slope value are not identical then generating said final transition bit signal to a "0",

(b) if said current slope and said previous slope value are identical then setting said final transition address signal to previous transition address signal and setting said previous transition address signal to a predetermined bias value.

15. A method as recited in claim 10 wherein said step of comparing said initial transition pixel data to said previously stored corresponding transition pixel data includes the steps of:

(a) reading said transition pixel data, including X coordinate value, Y coordinate value and transition information;

(b) comparing said Y value to predetermined limit values and to generate a tile test flag value;

(c) comparing said X and said Y values to previous X and Y values and to generate a stub test flag value;

(d) storing the current X and Y values;

(e) adding said Y coordinate value with a Y offset value;

(f) adding said X coordinate value with a X offset value; and

(g) using said Y coordinate value, said X coordinate value,

said tile test flag value, said stub test flag value, said set of transition flags including a Y transition flag, said process parameters and intermediate transition pixel data previously stored in said intermediate storage means, to generate said Y offset value and said X offset value, read and write instructions for controlling the intermediate storage means, and for outputting the current intermediate transition pixel data for return to the intermediate storage means.

16. A method as recited in claim 15 wherein said steps of generating said tile test flag value includes the steps of:

(a) comparing said Y coordinate value with a predetermined upper value, to generate an upper limit test flag value indicating that the Y coordinate value is less than said upper value;

(b) comparing said Y coordinate value with a predetermined lower value, to generate a lower test flag value indicating that the Y coordinate value is not less than said lower limit; and

(c) using said upper test flag value and said lower test flag value, to generate said tile test flag value when said Y coordinate value is less than said upper limit and equal or greater than said lower limit.

17. A method as recited in claim 15 wherein the step of generating said stub test flag includes the steps of:

(a) storing X and Y coordinate values of the last X transition into a first register;

(b) comparing current X and Y coordinate values with stored last X transitions X and Y coordinate values, to generate an X stub flag value;

(c) storing X and Y coordinate values of the last Y transition into a second register;

(d) comparing current X and Y coordinate values with stored last Y transitions X and Y coordinate values, to generate a Y stub flag value; and

(e) using said Y transition flag to select said X stub flag value when said Y transition flag is of a first state and to load current X and Y coordinates into said first register, and to select said Y stub flag value when said Y transition flag is of a second state and to load current X and Y coordinates into said second register.