US5255357A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for editing character bit maps at small sizes using connected runs
Assignee: Adobe Inc
•
Filing: 1993-05-25
•
Granted: 1993-10-19
•
Expires: 2013-05-25
Abstract
Abstract A material of displaying a character on a raster device wherein the character is described by means of one or more paths. The crosses where a path intersects horizontal pixel midlines are identified and paired in scan line order as cross pairs. Runs of pixels are identified from the cross pairs. Collisions are identified between two runs of pixels and the repair operation is performed to remove the collision while maintaining the integrity of the character. The most common repair operation is to move or delete one or more of the pixels involved in the collision.
Inventors
- 👤 Michael Byron
- 👤 Thomas Malloy
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-31 16:13
CPC Classifications
G; G06; G06K; G06K15/00; G06K15/02; G09; G09G; G09G5/00; G09G5/22; G09G5/24; G06K2215/00; G06K2215/0002; G06K2215/004; G06K2215/0042; G06K2215/0045; Y; Y10; Y10S; Y10S345/00; Y10S345/947; Y10S345/948
Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
140 words
In a method of displaying a character having one or more black areas in the form of a plurality of pixels on a raster device which generates a plurality of horizontal scan lines in sequential order, wherein the character is described by an outline comprising one or more path segments; a cross is defined by the intersection of the character outline with the horizontal midline of a pixel; a cross pair is defined by two crosses which reside on the same scan line; runs of pixels are identified as the pixels between the two crosses of a cross pair, an improvement comprising the steps of: identifying where two of said runs collide with each other to cause a collision, and repairing the character by eliminating said collision between said two runs of pixels while maintaining the integrity of the character.
Claim 2
Dependent Claim
140 words
In a method of displaying a character having one or more black areas in the form of a plurality of pixels on a raster device which generates a plurality of horizontal scan lines in sequential order, wherein the character is described by an outline comprising one or more path segments; a cross is defined by the intersection of the character outline with the horizontal midline of a pixel; a cross pair is defined by two crosses which reside on the same scan line; runs of pixels are identified as the pixels between the two crosses of a cross pair, an improvement comprising the steps of: identifying where two of said runs collide with each other to cause a collision, and repairing the character by eliminating said collision between said two runs of pixels while maintaining the integrity of the character.
Claim 3
Dependent Claim
19 words
The improvement of claim 1 wherein said collision is between two runs on the same scan line which overlap.
Claim 4
Dependent Claim
129 words
The improvement of claim 1 wherein the step of identifying said collision includes the steps of: (1) identifying a path segment whose endpoints occur at the locations defined by two crosses, both on the same scan line, and where the leftmost of said two crosses is the leftmost cross of its respective cross pair and the rightmost of said two crosses is the rightmost cross of its respective cross pair; (2) for each cross pair containing at least one of said two crosses, identifying the scan line adjacent to said same scan line and lying on the same side of said two crosses as said path segment; and (3) identifying runs of pixels in said adjacent scan line that touch said first run, thereby creating one or more collisions.
Claim 5
Dependent Claim
27 words
The improvement of claim 1 wherein said collision is where said two runs are black and are not adjacent in path order by touch at a corner.
Claim 6
Dependent Claim
30 words
The improvement of claim 1 wherein said collision to be repaired is between runs on the same scan line, said runs touching each other at one edge but not overlapping.
Claim 7
Dependent Claim
84 words
The improvement of claim 1 wherein a collision is defined by two runs of pixels, and wherein each of said runs of pixels has a pixel which touches a pixel of the other run, wherein said collision identification step includes identifying the touching pixels as two trespassers, the first trespasser having neighbor pixels, and wherein the repairing step includes deleting or moving a first of said trespassers based on the relative configuration of said first trespasser, its neighbor pixels and the said second trespasser.
Claim 8
Dependent Claim
51 words
The improvement of claim 6 wherein said relative configuration of said first trespasser, the neighbor pixels of said first trespasser and said second trespasser is evaluated on a three by three matrix having a pixel in each matrix cell, wherein said first trespasser is in the center cell of said matrix.
Claim 9
Dependent Claim
20 words
The improvement of claim 1 wherein said repairing step comprises moving or deleting a pixel in one of said runs.
Claim 10
Dependent Claim
14 words
The improvement of claim 8 wherein said repairing step moves one or more pixels.
Claim 11
Dependent Claim
37 words
The improvement of claim 1 wherein said collision to be repaired is a collision between two runs on different scan lines, each run having a pixel which touches a pixel in the other run at one corner.
Claim 12
Dependent Claim
51 words
The improvement of claim 1 wherein said collision to be repaired is a collision between two runs on different scan lines, each run having a pixel which touches a pixel in the other run at one edge and wherein at least one of said pixel runs is only one pixel wide.
Claim 13
Dependent Claim
41 words
The improvement of claim 1 wherein said collision to be repaired is a collision between two runs on the same scan line, each of said two runs having a pixel which touches a pixel on the other run on one edge.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1996-10-18 | 1997-04-19 | 1997-10-19 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-10-18 | 2001-04-19 | 2001-10-19 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-10-18 | 2005-04-19 | 2005-10-19 | $7700.00 | Window Closed / Lapsed |