US5133049A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Accelerated decomposition of small polygons into trapezoids
Assignee: HP Inc
•
Filing: 1990-03-14
•
Granted: 1992-07-21
•
Expires: 2010-03-14
Abstract
Abstract A method and device for improving the processing performance of a transform engine by off-loading the processing of those input polygons which have no more than a predetermined number of edges and decomposing such polygons into trapezoids which can be rendered by a scan conversion system. This is accomplished in accordance with the invention by reading edge data of each input polygon into a RAM and determining the relative positions of the Y coordinates of end points of each edge so that the beginning and end of each respective edge of the polygon in the Y direction may be determined. The polygon is then broken into trapezoids by reading in the respective beginning points of respective edges of the polygon and proceeding until the end point of one of the edges is reached. At the end of one edge, another edge of the polygon is read in, and the process continues until all trapezoids in the polygon have been drawn. Since trapezoids may be much more efficiently handled by the scan conversion system, a significant performance enhancement in the polygon processing is made possible in accordance with the invention.
Inventors
- 👤 Bradley W. Cain
- 👤 Randall D. Briggs
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 23:15
CPC Classifications
G; G06; G06T; G06T17/00; G06T17/20
Claims Analysis
Total Claims: 17
Claim 1
Independent Claim
214 words
A device for processing a plurality of polygons representative of an image to be displayed on a display device, each polygon having no more than a predetermined number of edges with associated edge data, comprising: means for providing said edge data for each input polygon of said image to be displayed; trapezoidilization means for breaking each input polygon having no more than said predetermined number of edges into at least one trapezoid, each trapezoid being a closed quadrilateral having three or four edges of which no more than two edges are not parallel to a coordinate direction of said display device, said trapezoidilization means comprising a RAM for storing said edge data for each input polygon, processing means for determining end points of each edge of each input polygon, means for ordering said end points in accordance with coordinate values of each end point in a direction perpendicular to said coordinate direction of said display device, and a stack register for storing said ordered end points of said edges of each input polygon and for storing a flag representing which end of an edge each end point represents in said direction perpendicular to said coordinate direction; and means for outputting the edge data for each trapezoid of each input polygon to said display device.
Claim 2
Independent Claim
214 words
A device for processing a plurality of polygons representative of an image to be displayed on a display device, each polygon having no more than a predetermined number of edges with associated edge data, comprising: means for providing said edge data for each input polygon of said image to be displayed; trapezoidilization means for breaking each input polygon having no more than said predetermined number of edges into at least one trapezoid, each trapezoid being a closed quadrilateral having three or four edges of which no more than two edges are not parallel to a coordinate direction of said display device, said trapezoidilization means comprising a RAM for storing said edge data for each input polygon, processing means for determining end points of each edge of each input polygon, means for ordering said end points in accordance with coordinate values of each end point in a direction perpendicular to said coordinate direction of said display device, and a stack register for storing said ordered end points of said edges of each input polygon and for storing a flag representing which end of an edge each end point represents in said direction perpendicular to said coordinate direction; and means for outputting the edge data for each trapezoid of each input polygon to said display device.
Claim 3
Dependent Claim
14 words
A device as in claim 1 wherein said providing means comprises a transform processor.
Claim 4
Dependent Claim
22 words
A device as in claim 1, wherein said providing means processes those input polygons having more than said predetermined number of edges.
Claim 5
Dependent Claim
42 words
A device as in claim 1, wherein said providing means provides each vertex of each input polygon to said processing means in a sequence of vertices such that adjacent vertices in the sequence of vertices define respective edges of each input polygon.
Claim 6
Dependent Claim
45 words
A device as in claim 4, wherein said processing means determines the coordinate value in the direction perpendicular to said coordinate direction of each end point of each respective edge of each input polygon and stores these values for each edge in said stack register.
Claim 7
Dependent Claim
168 words
A device as in claim 5, wherein each trapezoid of an input polygon is defined in said direction perpendicular to said coordinate direction from a starting end point of an edge of said input polygon, a flag of said starting end point indicating that said starting end point has a minimum coordinate value in the direction perpendicular to said coordinate direction for said edge, to a first encountered end point of an edge of said input polygon in the direction perpendicular to said coordinate direction, a flag of said first encountered end point indicating that said first encountered end point has a maximum coordinate value for an edge of the input polygon in the direction perpendicular to said coordinate direction, and is defined in a direction parallel to said coordinate direction from a first edge to a second edge of said input polygon, whereby edges of each trapezoid which are parallel to said coordinate direction respectively pass through the starting end point and the first encountered end point.
Claim 8
Dependent Claim
38 words
A device as in claim 6, wherein said starting end point and first encountered end point are taken from said ordered stack register as respective entries having different coordinate values in the direction perpendicular to the coordinate direction.
Claim 9
Independent Claim
200 words
A method of processing a plurality of polygons representative of an image to be displayed on a display device, each polygon having no more than a predetermined number of edges with associated edge data, comprising the steps of: providing said edge data for each input polygon of said image to be displayed; breaking each input polygon having no more than said predetermined number of edges into at least one trapezoid, each trapezoid being a closed quadrilateral having three or four edges of which no more than two edges are not parallel to a coordinate direction of said display device, said polygon breaking step comprising the steps of storing said edge data for each input polygon, determining end points of each edge of each input polygon, ordering said end points in accordance with coordinate values of each end point in a direction perpendicular to said coordinate direction of said display device, storing said ordered end points of said edges of each input polygon, and storing a flag representing which end of an edge each end point represents in said direction perpendicular to said coordinate direction; and outputting the edge data for each trapezoid of each input polygon to said display device.
Claim 10
Independent Claim
200 words
A method of processing a plurality of polygons representative of an image to be displayed on a display device, each polygon having no more than a predetermined number of edges with associated edge data, comprising the steps of: providing said edge data for each input polygon of said image to be displayed; breaking each input polygon having no more than said predetermined number of edges into at least one trapezoid, each trapezoid being a closed quadrilateral having three or four edges of which no more than two edges are not parallel to a coordinate direction of said display device, said polygon breaking step comprising the steps of storing said edge data for each input polygon, determining end points of each edge of each input polygon, ordering said end points in accordance with coordinate values of each end point in a direction perpendicular to said coordinate direction of said display device, storing said ordered end points of said edges of each input polygon, and storing a flag representing which end of an edge each end point represents in said direction perpendicular to said coordinate direction; and outputting the edge data for each trapezoid of each input polygon to said display device.
Claim 11
Dependent Claim
44 words
A method as in claim 8 wherein each vertex of each input polygon is provided to said processing means during said providing step in a sequence of vertices such that adjacent vertices in the sequence of vertices define respective edges of each input polygon.
Claim 12
Dependent Claim
46 words
A method as in claim 9, wherein said polygon breaking step includes the steps of determining the coordinate value in the direction perpendicular to said coordinate direction of each end point of each respective edge of each input polygon and storing these values for each edge.
Claim 13
Dependent Claim
176 words
A method as in claim 10, comprising the further step of rendering each polygon, wherein each trapezoid of a rendered polygon is defined in said direction perpendicular to said coordinate direction from a starting end point of an edge of said input polygon, a flag of said starting end point indicating that said starting end point has a minimum coordinate value in the direction perpendicular to said coordinate direction for said edge, to a first encountered end point of an edge of said input polygon in the direction perpendicular to said coordinate direction, a flag of said first encountered end point indicating that said first encountered end point has a maximum coordinate value for an edge of the input polygon in the direction perpendicular to said coordinate direction, and is defined in a direction parallel to said coordinate direction from a first edge to a second edge of said input polygon, whereby edges of each trapezoid which are parallel to the coordinate direction respectively pass through the starting end point and the first encountered end point.
Claim 14
Dependent Claim
29 words
A method as in claim 11, comprising the further steps of outputting a draw trapezoid command and indicating which of the data ouput corresponds to said draw trapezoid command.
Claim 15
Dependent Claim
67 words
A method as in claim 12, comprising the further step of outputting for use in said rendering step said draw trapezoid command, said starting end point, a difference in said direction perpendicular to said coordinate direction between coordinate values of said starting end point and said first encountered end point, and edge data identifying edges of said input polygon which are not parallel to said coordinate direction.
Claim 16
Independent Claim
149 words
A device for processing a plurality of polygons representative of an image to be displayed on a display device, each polygon having no more than a predetermined number of edges with associated edge data, comprising: means for providing said edge data for each input polygon of said image to be displayed; trapezoidilization means for breaking each input polygon having no more than said predetermined number of edges into at least one trapezoid, each trapezoid being a closed quadrilateral having three or four edges of which no more than two edges are not parallel to a coordinate direction of said display device; and means for outputting the edge data and a draw trapezoid command for each trapezoid of each input polygon to said display device, said outputting means comprising a command word register for indicating which of the date output by said outputting means corresponds to said draw trapezoid command.
Claim 17
Independent Claim
149 words
A device for processing a plurality of polygons representative of an image to be displayed on a display device, each polygon having no more than a predetermined number of edges with associated edge data, comprising: means for providing said edge data for each input polygon of said image to be displayed; trapezoidilization means for breaking each input polygon having no more than said predetermined number of edges into at least one trapezoid, each trapezoid being a closed quadrilateral having three or four edges of which no more than two edges are not parallel to a coordinate direction of said display device; and means for outputting the edge data and a draw trapezoid command for each trapezoid of each input polygon to said display device, said outputting means comprising a command word register for indicating which of the date output by said outputting means corresponds to said draw trapezoid command.
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) | 1995-07-21 | 1996-01-20 | 1996-07-21 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1999-07-21 | 2000-01-20 | 2000-07-21 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2003-07-21 | 2004-01-20 | 2004-07-21 | $7700.00 | Window Closed / Lapsed |