US5668940A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for anti-aliasing polygon edges in a computer imaging system
Assignee: Lockheed Martin Corp
•
Filing: 1994-08-19
•
Granted: 1997-09-16
•
Expires: 2014-08-19
Abstract
Abstract The final viewable color of each pixel to be displayed from video data signal output of a computer image generator, is found by: using input data signals setting display space coordinates of each vertex of each face polygon to be displayed, to generate a crossing location of each polygon edge along an edge segment of any of the array of display pixels; storing, and then processing, the edge segment crossing data signals for all polygons affecting that pixel, along with color data for each of the faces occupying any portion of that pixel, and for a plurality of different edge segments of a constellation of four adjacent pixels, to obtain pixel color intensity data for each corner of each displayable pixel; and mixing polygon color intensity data signals for all corners of a presently-processed pixel, to determine the final, observable color of that display pixel.
Inventors
- 👤 Walter Robert Steiner
- 👤 Michael Leroy Morgan
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 06:29
CPC Classifications
G; G06; G06T; G06T11/00; G06T11/10
Claims Analysis
Total Claims: 22
Claim 1
Independent Claim
224 words
A method for determining the final viewable color of each of an array of pixels to be displayed responsive to a video data signal output of a computer image generator, comprising the steps of: (a) first receiving input data signals characterizing a set of display space (I,J) coordinates of each of at least three vertices of each of at least one face polygon to be displayed, each different pair of the vertices defining a different edge of the associated face polygon; (b) generating, responsive to the received vertex data signals, a data signal describing a location of a crossing, if any, of each face polygon edge along an associated one of a plurality of edge segments bounding each pixel of the display pixel array; (c) storing, on a per-pixel basis, the edge segment crossing data signals for all face polygons affecting that pixel, along with color data for each of the face polygons occupying any portion of that pixel; (d) processing, for each pixel to be displayed, stored data for a plurality of different edge segments of a selected constellation of a plurality of adjacent pixels, to obtain a color intensity data signal for each corner of each displayable pixel; and (e) mixing color intensity data signals for all corners of a presently-processed pixel, to determine the final, observable color of that display pixel.
Claim 2
Independent Claim
224 words
A method for determining the final viewable color of each of an array of pixels to be displayed responsive to a video data signal output of a computer image generator, comprising the steps of: (a) first receiving input data signals characterizing a set of display space (I,J) coordinates of each of at least three vertices of each of at least one face polygon to be displayed, each different pair of the vertices defining a different edge of the associated face polygon; (b) generating, responsive to the received vertex data signals, a data signal describing a location of a crossing, if any, of each face polygon edge along an associated one of a plurality of edge segments bounding each pixel of the display pixel array; (c) storing, on a per-pixel basis, the edge segment crossing data signals for all face polygons affecting that pixel, along with color data for each of the face polygons occupying any portion of that pixel; (d) processing, for each pixel to be displayed, stored data for a plurality of different edge segments of a selected constellation of a plurality of adjacent pixels, to obtain a color intensity data signal for each corner of each displayable pixel; and (e) mixing color intensity data signals for all corners of a presently-processed pixel, to determine the final, observable color of that display pixel.
Claim 3
Dependent Claim
50 words
The method of claim 1, wherein step (b) includes the steps of: utilizing selected ones of a set of the four pixel corners as sample points; and determining crossing location data for edge segments extending from a designated one of the pixel corners to another corner of the same pixel.
Claim 4
Dependent Claim
58 words
The method of claim 2, wherein step (c) further includes the steps of: determining a translucency value T for each pixel between transparent and opaque; not storing any data for a pixel having a T value indicating transparency; and increasing a number of corner sample points for which data is stored responsive to increasing the translucency value T.
Claim 5
Dependent Claim
28 words
The method of claim 3, including the step of storing data for all four pixel corners only if that pixel has a translucency value T for full opaqueness.
Claim 6
Dependent Claim
53 words
The method of claim 3, further including the steps of: providing a plurality of complementary patterns of pixel corners at which data is to be stored, for each of a plurality of ranges of T values less than a maximum value; and selecting a different one of the patterns for any face polygon.
Claim 7
Dependent Claim
36 words
The method of claim 5, further including the step of randomly selecting one of a pair of patterns for each polygon having a T value within a preselected range and associated with a particular display pixel.
Claim 8
Dependent Claim
30 words
The method of claim 1, wherein step (d) includes the step of selecting constellation pixels to be adjacent to at least one edge segment joining pairs of the pixel corners.
Claim 9
Dependent Claim
23 words
The method of claim 7, including the step of configuring the constellation to include four other pixels, adjacent to the pixel being processed.
Claim 10
Dependent Claim
28 words
The method of claim 8, further including the step of selecting the other constellation pixels to be respectively immediately above, below, preceding and following the pixel being processed.
Claim 11
Dependent Claim
51 words
The method of claim 1, wherein a plurality of face polygons contribute to the color of the pixel being process, and further including the step of obtaining the color of the pixel being processed by blending chroma data from all polygons covering any active one of the corners of that pixel.
Claim 12
Dependent Claim
30 words
The method of claim 10, further including the step of modifying the chroma data from each covering polygon responsive to the translucency of the particular polygon, prior to chroma blending.
Claim 13
Dependent Claim
26 words
The method of claim 11, further including the step of digitally filtering out all polygons having an area less than the area of one display pixel.
Claim 14
Dependent Claim
46 words
The method of claim 1, wherein step (b) further includes the steps of: determining a translucency value T for each pixel between transparent and opaque; and varying a number of corner sample points for which data is stored responsive to variation of the translucency value T.
Claim 15
Dependent Claim
46 words
The method of claim 13, further including the step of increasing the magnitude of the edge crossing data to move the associated edge crossing away from an associated pixel corner, responsive to an increase in the translucency value of the polygon associated with that pixel corner.
Claim 16
Dependent Claim
38 words
The method of claim 14, further including the step of clamping the value of the edge crossing data to a predetermined maximum if the edge crossing distance in a selected direction is greater than an inter-sample point distance.
Claim 17
Dependent Claim
58 words
The method of claim 15, wherein the display space is a display raster, and including the steps of: modifying edge crossing distances in a first raster direction for selected ones of the pixel corners; and modifying edge crossing distances in a second direction, generally perpendicular to the first raster direction, for all remaining ones of the pixel corners.
Claim 18
Dependent Claim
203 words
A color intensity subassembly for a display processor in a computer image generator (GIG), comprising: edge interception calculator means, receiving input data signals characterizing a set of display space (I,J) coordinates for each of at least three vertices of each of a multiplicity of face polygons to be displayed, for determining (a) which edge segments, if any, of each of a sequential series of viewable display pixels are crossed by a polygon edge defined by each different pair of the received vertex data signals, and (b) a location of the crossing along the associated pixel edge segment; frame buffer means for storing, on a per-pixel basis, the edge crossing data signals for all polygons affecting each pixel, along with color data for each of the face polygons occupying any portion of that pixel; and post processor means, receiving from the frame buffer means data signals characterizing, for each pixel to be displayed, a plurality of edge data signals for a constellation of a plurality of adjacent pixels, for resolving edge relationships and mixing polygon color intensity data to determine the final, observable color data signal for each pixel to be displayed by a display means receiving a video data output of the CIG.
Claim 19
Dependent Claim
203 words
A color intensity subassembly for a display processor in a computer image generator (GIG), comprising: edge interception calculator means, receiving input data signals characterizing a set of display space (I,J) coordinates for each of at least three vertices of each of a multiplicity of face polygons to be displayed, for determining (a) which edge segments, if any, of each of a sequential series of viewable display pixels are crossed by a polygon edge defined by each different pair of the received vertex data signals, and (b) a location of the crossing along the associated pixel edge segment; frame buffer means for storing, on a per-pixel basis, the edge crossing data signals for all polygons affecting each pixel, along with color data for each of the face polygons occupying any portion of that pixel; and post processor means, receiving from the frame buffer means data signals characterizing, for each pixel to be displayed, a plurality of edge data signals for a constellation of a plurality of adjacent pixels, for resolving edge relationships and mixing polygon color intensity data to determine the final, observable color data signal for each pixel to be displayed by a display means receiving a video data output of the CIG.
Claim 20
Dependent Claim
44 words
The subassembly of claim 17, wherein said post processor means further receives data signals describing a translucency value T of each polygon contributing to the total color of a present pixel, and blends the color information signals thereof responsive to the T values received.
Claim 21
Dependent Claim
20 words
The subassembly of claim 17, wherein the pixel constellation includes four additional pixels adjacent to each pixel presently being processed.
Claim 22
Dependent Claim
82 words
The subassembly of claim 19, wherein the post processor means includes: corner data register means for simultaneously providing data signals for corners along a plurality of display raster edge lines; holding register means, receiving the data signals for each edge line, for simultaneously providing data signals for a plurality of corners along each of the plurality of edge lines; and segment calculator means, connected to the register means, for determining a crossing length along each of a plurality of constellation pixel edges.
References Cited (Backward Citations)
US4677576A
Cited
US4727365A
Cited
US4727365B1
Cited
US4825391A
Cited
US5392385A
Cited
US5363475A
Cited
US5339092A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2000-09-15 | 2001-03-17 | 2001-09-16 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-09-15 | 2005-03-17 | 2005-09-16 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-09-15 | 2009-03-17 | 2009-09-16 | $7700.00 | Window Closed / Lapsed |