US5613052A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for clipping and determining color factors for polygons
Assignee: International Business Machines Corp
•
Filing: 1993-09-02
•
Granted: 1997-03-18
•
Expires: 2013-09-02
Abstract
Abstract A method for clipping a graphical polygon to a clip region, the polygon being defined by multiple vertices with connecting edges, including the steps of computing which vertices of a polygon to be displayed may be discarded and computing at least one color factor only for vertices not discarded, computing boundary vertices on any edges intersect a clip region boundary and computing at least one color factor therefor, and displaying the vertices according to the computed color factors. In addition, an apparatus for clipping a graphical polygon to a clip region, the polygon being defined by multiple vertices with connecting edges, including apparatus for computing which vertices of a polygon to be displayed may be discarded and for computing at least one color factor only for vertices not discarded, apparatus for computing boundary vertices on any edges that intersect a clip region boundary and for computing at least one color factor therefor, and apparatus for displaying said vertices according to the computed color factors.
Inventors
- 👤 Chandrasekhar Narayanaswami
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-31 12:40
CPC Classifications
G; G06; G06T; G06T15/00; G06T15/10; G06T15/30
Claims Analysis
Total Claims: 16
Claim 1
Independent Claim
132 words
A method of clipping a graphical polygon to a clip region, said polygon being defined by a plurality of vertices with connecting edges, comprising the steps of: computing which vertices of a polygon to be displayed are discarded, the discarded vertices being not connected to an edge that intersects the clip region, and computing at least one color factor only for vertices not discarded; computing boundary vertices on any edges that intersect a clip region boundary and computing at least one color factor therefor by interpolating color factors previously computed for vertices connected to said edges; computing at least one color factor for each edge point within said clip region by interpolating color factors previously computed for vertices connected to said edge; and displaying said vertices according to said computed color factors.
Claim 2
Independent Claim
132 words
A method of clipping a graphical polygon to a clip region, said polygon being defined by a plurality of vertices with connecting edges, comprising the steps of: computing which vertices of a polygon to be displayed are discarded, the discarded vertices being not connected to an edge that intersects the clip region, and computing at least one color factor only for vertices not discarded; computing boundary vertices on any edges that intersect a clip region boundary and computing at least one color factor therefor by interpolating color factors previously computed for vertices connected to said edges; computing at least one color factor for each edge point within said clip region by interpolating color factors previously computed for vertices connected to said edge; and displaying said vertices according to said computed color factors.
Claim 3
Dependent Claim
26 words
The method of claim 1 wherein the step of computing a color factor for vertices not discarded includes computing a lighting function for vertices not discarded.
Claim 4
Dependent Claim
26 words
The method of claim 1 wherein the step of computing a color factor for vertices not discarded includes computing a modeling function for vertices not discarded.
Claim 5
Independent Claim
139 words
An apparatus for clipping a graphical polygon to a clip region, said polygon being defined by a plurality of vertices with connecting edges, comprising: means for computing which vertices of a polygon to be displayed are discarded, the discarded vertices being not connected to an edge that intersects the clip region, and for computing at least one color factor only for vertices not discarded; means for computing boundary vertices on any edges that intersect a clip region boundary and for computing at least one color factor therefor by interpolating color factors previously computed for vertices connected to said edges; means for computing at least one color factor for each edge point within said clip region by interpolating color factors previously computed for vertices connected to said edge; and means for displaying said vertices according to said computed color factors.
Claim 6
Independent Claim
139 words
An apparatus for clipping a graphical polygon to a clip region, said polygon being defined by a plurality of vertices with connecting edges, comprising: means for computing which vertices of a polygon to be displayed are discarded, the discarded vertices being not connected to an edge that intersects the clip region, and for computing at least one color factor only for vertices not discarded; means for computing boundary vertices on any edges that intersect a clip region boundary and for computing at least one color factor therefor by interpolating color factors previously computed for vertices connected to said edges; means for computing at least one color factor for each edge point within said clip region by interpolating color factors previously computed for vertices connected to said edge; and means for displaying said vertices according to said computed color factors.
Claim 7
Dependent Claim
26 words
The apparatus of claim 4 wherein the means for computing a color factor for vertices not discarded includes computing a lighting function for vertices not discarded.
Claim 8
Dependent Claim
26 words
The apparatus of claim 4 wherein the means for computing a color factor for vertices not discarded includes computing a modeling function for vertices not discarded.
Claim 9
Dependent Claim
176 words
A data processing system for clipping a graphical polygon to a clip region, said polygon being defined by a plurality of vertices with connecting edges, comprising: processing means for processing data; storage means for storing data to be processed; and graphics processing means coupled to said processing means for processing graphical data, said graphics processing means including: i) means for computing which vertices of a polygon to be displayed are discarded, the discarded vertices being not connected to an edge that intersects the clip region, and for computing at least one color factor only for vertices not discarded; ii) means for computing boundary vertices on any edges that intersect a clip region boundary and for computing at least one color factor therefor by interpolating color factors previously computed for vertices connected to said edges; iii) means for computing at least one color factor for each edge point within said clip region by interpolating color factors previously computed for vertices connected to said edge; and iv) means for displaying said vertices according to said computed color factors.
Claim 10
Dependent Claim
176 words
A data processing system for clipping a graphical polygon to a clip region, said polygon being defined by a plurality of vertices with connecting edges, comprising: processing means for processing data; storage means for storing data to be processed; and graphics processing means coupled to said processing means for processing graphical data, said graphics processing means including: i) means for computing which vertices of a polygon to be displayed are discarded, the discarded vertices being not connected to an edge that intersects the clip region, and for computing at least one color factor only for vertices not discarded; ii) means for computing boundary vertices on any edges that intersect a clip region boundary and for computing at least one color factor therefor by interpolating color factors previously computed for vertices connected to said edges; iii) means for computing at least one color factor for each edge point within said clip region by interpolating color factors previously computed for vertices connected to said edge; and iv) means for displaying said vertices according to said computed color factors.
Claim 11
Dependent Claim
28 words
The data processing system of claim 7 wherein the means for computing a color factor for vertices not discarded includes computing a lighting function for vertices not discarded.
Claim 12
Dependent Claim
28 words
The data processing system of claim 7 wherein the means for computing a color factor for vertices not discarded includes computing a modeling function for vertices not discarded.
Claim 13
Dependent Claim
196 words
A computer program product comprising: a computer usable medium having computer readable program code means embodied in said medium for clipping a graphical polygon to a clip region, said polygon being defined by a plurality of vertices with connecting edges, said computer program product having: computer readable program code means for causing a computer to effect computing which vertices of a polygon to be displayed are discarded, the discarded vertices being not connected to an edge that intersects the clip region, and for computing at least one color factor only for vertices not discarded; computer readable program code means for causing a computer to effect computing boundary vertices on any edges that intersect a clip region boundary and for computing at least one color factor therefor by interpolating color factors previously computed for vertices connected to said edges; computer readable program code means for causing a computer to effect computing at least one color factor for each edge point within said clip region by interpolating color factors previously computed for vertices connected to said edge; and computer readable program code means for causing a computer to effect displaying said vertices according to said computed color factors.
Claim 14
Dependent Claim
196 words
A computer program product comprising: a computer usable medium having computer readable program code means embodied in said medium for clipping a graphical polygon to a clip region, said polygon being defined by a plurality of vertices with connecting edges, said computer program product having: computer readable program code means for causing a computer to effect computing which vertices of a polygon to be displayed are discarded, the discarded vertices being not connected to an edge that intersects the clip region, and for computing at least one color factor only for vertices not discarded; computer readable program code means for causing a computer to effect computing boundary vertices on any edges that intersect a clip region boundary and for computing at least one color factor therefor by interpolating color factors previously computed for vertices connected to said edges; computer readable program code means for causing a computer to effect computing at least one color factor for each edge point within said clip region by interpolating color factors previously computed for vertices connected to said edge; and computer readable program code means for causing a computer to effect displaying said vertices according to said computed color factors.
Claim 15
Dependent Claim
37 words
The computer program product of claim 10 wherein the computer readable program code means for causing a computer to effect computing a color factor for vertices not discarded includes computing a lighting function for vertices not discarded.
Claim 16
Dependent Claim
37 words
The computer program product of claim 10 wherein the computer readable program code means for causing a computer to effect computing a color factor for vertices not discarded includes computing a modeling function for vertices not discarded.
References Cited (Backward Citations)
US3816726A
Cited
EP0163852A2
Cited
US4941111A
Cited
US4866637A
Cited
US4888712A
Cited
US4945500A
Cited
US4958305A
Cited
US5051737A
Cited
GB2232564A
Cited
US5079719A
Cited
US5159665A
Cited
US5357599A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2000-03-17 | 2000-09-16 | 2001-03-18 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-03-17 | 2004-09-16 | 2005-03-18 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-03-17 | 2008-09-16 | 2009-03-18 | $7700.00 | Window Closed / Lapsed |