US5276790A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Fast vertical scan-conversion and filling method and apparatus for outline font character generation in dot matrix devices
Assignee: Primax Electronics Ltd
•
Filing: 1991-07-12
•
Granted: 1994-01-04
•
Expires: 2011-07-12
Abstract
Abstract A fast vertical scan-conversion and filling method and apparatus for outline font character generation in dot matrix devices including a normalized polysegment generation engine for converting spline data to normalized polysegment data, a vertical scan conversion engine comprised of a decision table transitioner (DT) unit for identifying the location of a transition pixel relative to each polysegment or indicating that an identification cannot be made, intersection transition calculating unit (IT) for calculating the position of a transition pixel relative to each polysegment, and a transition pixel coordinate generating unit responsive to the normalized polysegment data and input received from the DT and IT units and operative to generate signals corresponding to the X and Y coordinates of each transition pixel, and a parity filling engine responsive to the x and y coordinate segment and operative to generate bit mapped character image data for use in driving a bit map print or display device.
Inventors
- 👤 Jim C. K. Lo
- 👤 James C. Y. Lung
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-31 22:16
CPC Classifications
G; G06; G06K; G06K15/00; G06K15/02; G06T; G06T11/00; G06T11/20; G06T11/23; G06K2215/00; G06K2215/0002; G06K2215/004; G06K2215/0042; G06K2215/0045; Y; Y10; Y10S; Y10S345/00; Y10S345/947
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
157 words
Apparatus for converting image data in spline outline format into bit mapped data suitable for driving dot matrix devices, comprising: normalized polysegment data generating means for converting spline data into normalized polysegment data representing straight lines, called polysegments, used to approximate the spline curves represented by said spline data, and having lengths equal to or less than the length of a diagonal dimension of a nominal pixel area of a pixel to be printed or displayed; vertical scan conversion means responsive to said normalized polysegment data and operative to develop transition pixel data locating transition pixels corresponding to each intersection of a polysegment with a reference line passing through a particular point of each pixel in a row of pixels, a transition pixel being defined as a pixel having a predetermined positional relationship to a particular intersection; and parity scan filling means responsive to said transition pixel data and operative to generate bit mapped data corresponding thereto.
Claim 2
Dependent Claim
157 words
Apparatus for converting image data in spline outline format into bit mapped data suitable for driving dot matrix devices, comprising: normalized polysegment data generating means for converting spline data into normalized polysegment data representing straight lines, called polysegments, used to approximate the spline curves represented by said spline data, and having lengths equal to or less than the length of a diagonal dimension of a nominal pixel area of a pixel to be printed or displayed; vertical scan conversion means responsive to said normalized polysegment data and operative to develop transition pixel data locating transition pixels corresponding to each intersection of a polysegment with a reference line passing through a particular point of each pixel in a row of pixels, a transition pixel being defined as a pixel having a predetermined positional relationship to a particular intersection; and parity scan filling means responsive to said transition pixel data and operative to generate bit mapped data corresponding thereto.
Claim 3
Dependent Claim
89 words
Apparatus as recited in claim 1 wherein said vertical scan conversion means includes decision transition logic means responsive to said normalized polysegment data and operative to develop first signals indicating for each polysegment whether or not a pixel transition can be identified, whether or not a corresponding pixel transition exists, and whether a pixel transition exists at the pixel in which a present polysegment endpoint resides or in a pixel adjacent thereto, or at the pixel in which the opposite polysegment endpoint resides or in a pixel adjacent thereto.
Claim 4
Dependent Claim
82 words
Apparatus as recited in claim 2 wherein said vertical scan conversion means further includes intersection transition computation means responsive to said normalized polysegment data and operative to computationally develop second signals indicating for each polysegment whether or not a corresponding pixel transition exists and, if so, whether it exists at the pixel in which a present polysegment endpoint resides or in a pixel adjacent thereto, or at the pixel in which the opposite polysegment endpoint resides or in a pixel adjacent thereto.
Claim 5
Dependent Claim
86 words
Apparatus as recited in claim 3 wherein said vertical scan conversion means further includes output means responsive to said normalized polysegment data, said first signals and said second signals, and operative to use said first signals to generate said transition pixel data if it indicates that said decision transition logic means can identify a pixel transition, but operative to use said second signals to generate said transition pixel data if said first signals indicate that said decision transition logic means can not identify a pixel transition.
Claim 6
Independent Claim
142 words
A method of converting image data in spline outline format into bit mapped data suitable for driving dot matrix devices, comprising the steps of: converting the spline data into normalized polysegment data representing straight lines, called polysegments, used to approximate the spline curves represented by said spline data, and having lengths equal to or less than the length of a diagonal dimension of a nominal pixel area of a pixel to be printed or displayed; using said normalized polysegment data to develop transition pixel data locating transition pixels corresponding to each intersection of a polysegment with a reference line passing through a particular point of each pixel in a row of pixels, a transition pixel being defined as a pixel having a predetermined positional relationship to a particular intersection; and using said transition pixel data to generate bit mapped data corresponding thereto.
Claim 7
Independent Claim
142 words
A method of converting image data in spline outline format into bit mapped data suitable for driving dot matrix devices, comprising the steps of: converting the spline data into normalized polysegment data representing straight lines, called polysegments, used to approximate the spline curves represented by said spline data, and having lengths equal to or less than the length of a diagonal dimension of a nominal pixel area of a pixel to be printed or displayed; using said normalized polysegment data to develop transition pixel data locating transition pixels corresponding to each intersection of a polysegment with a reference line passing through a particular point of each pixel in a row of pixels, a transition pixel being defined as a pixel having a predetermined positional relationship to a particular intersection; and using said transition pixel data to generate bit mapped data corresponding thereto.
Claim 8
Dependent Claim
80 words
A method as recited in claim 5 wherein said step of using said normalized polysegment data includes developing first signals indicating for each polysegment whether or not a pixel transition can be identified, whether or not a corresponding pixel transition exists, and whether a pixel transition exists at the pixel in which a present polysegment endpoint resides or in a pixel adjacent thereto, or at the pixel in which the opposite polysegment endpoint resides or in a pixel adjacent thereto.
Claim 9
Dependent Claim
73 words
A method as recited in claim 6 wherein said step of using said normalized polysegment data further includes computationally developing second signals indicating for each polysegment whether or not a corresponding pixel transition exists and, if so, whether it exists at the pixel in which a present polysegment endpoint resides or in a pixel adjacent thereto, or at the pixel in which the opposite polysegment endpoint resides or in a pixel adjacent thereto.
Claim 10
Dependent Claim
72 words
A method as recited in claim 7 wherein said step of using said normalized polysegment data further includes using said first signals to generate said transition pixel data if it indicates that said decision transition logic means can identify a pixel transition, but operative to use said second signals to generate said transition pixel data if said first signals indicate that said decision transition logic means can not identify a pixel transition.
References Cited (Backward Citations)
US4626838A
Cited
US4745575A
Cited
US4759965A
Cited
US4949281A
Cited
US4855935A
Cited
US4937761A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-01-03 | 1997-07-05 | 1998-01-04 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-01-03 | 2001-07-05 | 2002-01-04 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-01-03 | 2005-07-05 | 2006-01-04 | $7700.00 | Window Closed / Lapsed |