US5159665A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Graphics accelerator system
Assignee: Sun Microsystems Inc
•
Filing: 1989-11-27
•
Granted: 1992-10-27
•
Expires: 2009-11-27
Abstract
Abstract A graphics accelerator interface apparatus for receiving information to be displayed by a computer and the address of such information. Storing the addresses of vertices of a quadrilateral to be displayed by a computer, translating the addresses of vertices of a quadrilateral into signals representing the relations between each of such vertices and the others of the vertices, selectively decomposing a quadrilateral into line segment portions defining trapezoids which bound sets of scan lines, determining the coordinates of the end points of each scan line within such trapezoids, translating the coordinates of the end points into linear values for display, and storing such information for display on a computer output display.
Inventors
- 👤 Curtis Priem
- 👤 Chris Malachowsky
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-28 02:37
CPC Classifications
G; G06; G06T; G06T15/00; G06T15/005
Claims Analysis
Total Claims: 76
Claim 1
Independent Claim
188 words
A graphics accelerator circuit for rapidly processing graphics information to be displayed by a computer output display on a scan line basis, said graphics accelerator circuit comprising: interface means for receiving said graphics information to be displayed by said computer output display, said interface means comprising a plurality of flip-flops; means for storing addresses of vertices of at least one quadrilateral corresponding to said graphics information, said means for storing comprising at least one register; means for comparing the relative positions of said addresses of said vertices and providing signals corresponding to said comparisons, said means for comparing comprising at least one comparator, and at least one multiplexer; means for selectively decomposing said quadrilateral into line segment portions, said line segment portions defining trapezoids, said trapezoids bounding sets of scan lines; means for determining the coordinates of the end points of each scan line within said trapezoids; means for translating said coordinates into scan line information for display by said computer output display; means for providing said scan line information to said computer output display for display; means for displaying said graphics information on a scan line basis.
Claim 2
Dependent Claim
188 words
A graphics accelerator circuit for rapidly processing graphics information to be displayed by a computer output display on a scan line basis, said graphics accelerator circuit comprising: interface means for receiving said graphics information to be displayed by said computer output display, said interface means comprising a plurality of flip-flops; means for storing addresses of vertices of at least one quadrilateral corresponding to said graphics information, said means for storing comprising at least one register; means for comparing the relative positions of said addresses of said vertices and providing signals corresponding to said comparisons, said means for comparing comprising at least one comparator, and at least one multiplexer; means for selectively decomposing said quadrilateral into line segment portions, said line segment portions defining trapezoids, said trapezoids bounding sets of scan lines; means for determining the coordinates of the end points of each scan line within said trapezoids; means for translating said coordinates into scan line information for display by said computer output display; means for providing said scan line information to said computer output display for display; means for displaying said graphics information on a scan line basis.
Claim 3
Dependent Claim
42 words
A graphics accelerator circuit as claimed in claim 1 further comprising means for determining the direction in which said quadrilateral should be decomposed in order to most rapidly accomplish the transfer and processing of said graphics information by said graphics accelerator circuit.
Claim 4
Dependent Claim
32 words
A graphics accelerator circuit as claimed in claim 2 further comprising means for presenting scan line information in scan line order no matter what direction the decomposition of said quadrilateral has proceeded.
Claim 5
Dependent Claim
52 words
A graphics accelerator circuit as claimed in claim 2 in which the means for determining the direction in which said quadrilateral should be decomposed functions in response to the signals provided by said means for comparing the relative positions of said addresses of said vertices and providing signals corresponding to said comparisons.
Claim 6
Dependent Claim
32 words
A graphics accelerator circuit as claimed in claim 4 further comprising means for presenting scan line information in scan line order no matter what direction the decomposition of said quadrilateral has proceeded.
Claim 7
Dependent Claim
56 words
A graphics accelerator circuit as claimed in claim 1 further comprising means for receiving information regarding the position of a window in which particular data is to be presented on said computer output display, and means for providing signals representing the relations between each of said vertices of said quadrilateral and the boundaries of said window.
Claim 8
Dependent Claim
99 words
A graphics accelerator circuit as claimed in claim 6 further comprising means for determining the direction in which said quadrilateral should be decomposed in order to most rapidly accomplish the transfer and processing of said graphics information by said graphics accelerator circuit, said means functioning in response to the signals provided by said means for comparing the relative positions of said addresses of said vertices and providing signals corresponding to said comparisons, and the signals provided by said means for providing signals representing the relations between each of said vertices of said quadrilateral and the boundaries of said window.
Claim 9
Dependent Claim
32 words
A graphics accelerator circuit as claimed in claim 7 further comprising means for presenting scan line information in scan line order no matter what direction the decomposition of said quadrilateral has proceeded.
Claim 10
Dependent Claim
54 words
A graphics accelerator circuit as claimed in claim 6 further comprising means for receiving information regarding the position of a rectangle surrounding said window in which particular data is to be presented, and means for providing signals representing the relations between each of said vertices of said quadrilateral and the boundaries of said rectangle.
Claim 11
Dependent Claim
28 words
A graphics accelerator circuit as claimed in claim 9 further comprising means for determining whether a particular graphics operation is to be accomplished by said graphics accelerator circuit.
Claim 12
Dependent Claim
54 words
A graphics accelerator circuit as claimed in claim 10 in which said means for determining whether a particular graphics operation is to be accomplished by said graphics accelerator circuit comprises a status register having at least one bit position representing whether a particular graphics operation is to be accomplished by said graphics accelerator circuit.
Claim 13
Dependent Claim
69 words
A graphics accelerator circuit as claimed in claim 11 in which said status register further includes a plurality of bit positions representing exceptions which preclude said graphics accelerator circuit from accomplishing a particular graphics operation, and means for ORing the bits in said bit positions representing exceptions into said at least one bit position representing whether a particular graphics operation is to be accomplished by said graphics accelerator circuit.
Claim 14
Dependent Claim
25 words
A graphics accelerator circuit as claimed in claim 12 further comprising means for transferring said precluded graphics operations to an associated processor to be conducted.
Claim 15
Dependent Claim
59 words
A graphics accelerator circuit as claimed in claim 10 in which said means for determining whether a particular graphics operation is to be accomplished by said graphics accelerator circuit operates in response to the signals provided by said means for providing signals representing the relations between each of said vertices of said quadrilteral and the boundaries of said rectangle.
Claim 16
Dependent Claim
40 words
A graphics accelerator circuit as claimed in claim 10 further comprising means for testing the condition of said at least one bit position of said status register and launching a graphics operation if that bit does not indicate an exception.
Claim 17
Dependent Claim
31 words
A graphics accelerator circuit as claimed in claim 1 in which the means for translating said coordinates comprises means for translating said coordinates into a number of distinct resolutions for display.
Claim 18
Dependent Claim
54 words
A graphics accelerator circuit as claimed in claim 1 further comprising means for receiving information regarding the position of a rectangle surrounding a window in which particular data is to be presented, and means for providing signals representing the relations between each of said vertices of said quadrilateral and the boundaries of said rectangle.
Claim 19
Dependent Claim
48 words
A graphics accelerator circuit as claimed in claim 1 in which the means for determining the coordinates of the end points of each scan line within said trapezoids includes means for separately determining the end points of each scan line on each of the bounding line segments simultaneously.
Claim 20
Dependent Claim
28 words
A graphics accelerator circuit as claimed in claim 1 in which the means for selectively decomposing said quadrilateral into line segment portions comprises a matrix implemented in circuitry.
Claim 21
Dependent Claim
30 words
A graphics accelerator circuit as claimed in claim 1 further comprising circuitry for clipping said quadrilateral to fit within a particular window to be displayed on said computer output display.
Claim 22
Dependent Claim
40 words
A graphics accelerator circuit as claimed in claim 20 in which the circuitry for clipping said quadrilateral comprises means for determining whether a particular scan line of information to be displayed in said particular window lies within said particular window.
Claim 23
Dependent Claim
56 words
A graphics accelerator as claimed in claim 20 in which the circuitry for clipping said quadrilateral comprises means for comparing the horizontal values for said quadrilateral on each scan line to be displayed in said particular window with the left and right edges of said window to determine if the values lie within said particular window.
Claim 24
Dependent Claim
61 words
A graphics accelerator circuit as claimed in claim 1 further comprising means for translating numbers in a first number format to numbers stated in an internal number format, means for manipulating numbers based in the internal number format utilizing conventional matrix transformation operations, and means for translating numbers stated in the internal number format into numbers in the first number format.
Claim 25
Dependent Claim
123 words
A graphics accelerator as claimed in claim 23 in which said means for translating numbers in a first number format to numbers stated in an internal number format comprises means for translating numbers in a first number format to numbers stated in Modulo 256 with multiple tap points number format, said means for manipulating numbers based in an internal number format comprises means for manipulating numbers based in Modulo 256 with multiple tap point format utilizing conventional matrix transformation operations, and in which said means for translating numbers stated in the internal number format into numbers in the first number format comprises means for translating numbers stated in Modulo 256 with multiple tap points number format into numbers in the first number format.
Claim 26
Dependent Claim
20 words
A graphics accelerator circuit as claimed in claim 23 in which said first number format is an integer number format.
Claim 27
Dependent Claim
21 words
A graphics accelerator circuit as claimed in claim 23 in which said first number format is a floating point number format.
Claim 28
Dependent Claim
20 words
A graphics accelerator circuit as claimed in claim 23 in which said first number format is a FRACT number format.
Claim 29
Dependent Claim
24 words
A graphics accelerator circuit as claimed in claim 1 in which said interface means comprises means for receiving graphics information both synchronously and asynchronously.
Claim 30
Dependent Claim
57 words
A graphics accelerator circuit as claimed in claim 1 wherein said interface means comprises means for storing the address of a block of data to be displayed in said output display, and means for moving said block of data to a new position on said output display by providing a new address for said block of data.
Claim 31
Dependent Claim
64 words
A graphics accelerator circuit as claimed in claim 29 further comprising means for receiving information regarding the position of a window on said computer output display in which said block of data is to be presented, and means for providing signals representing the relations between each of the boundaries of the new position of said block of data and the boundaries of said window.
Claim 32
Dependent Claim
43 words
A graphics accelerator circuit as claimed in claim 29 further comprising means for determining the direction in which said block of data should be processed in order to most rapidly accomplish transfer and processing of the information by the said graphics accelerator circuit.
Claim 33
Dependent Claim
80 words
A graphics accelerator circuit as claimed in claim 31 in which the means for determining the direction in which said block of data should be processed in order to most rapidly accomplish the transfer and processing of said graphics information by said graphics accelerator circuit functions in response to signals provided by said means for providing signals representing the relations between each of the boundaries of the new position of said block of data and the boundaries of said window.
Claim 34
Dependent Claim
33 words
A graphics accelerator circuit as claimed in claim 32 further comprising means for presenting scan line information in scan line order no matter what direction processing of said block of data has proceeded.
Claim 35
Dependent Claim
37 words
A graphics accelerator circuit as claimed in claim 29 further comprising means for presenting scan line information in scan line order no matter what direction the processing of the information by the graphics accelerator circuit has proceeded.
Claim 36
Dependent Claim
58 words
A graphics accelerator circuit as claimed in claim 29 further comprising means for receiving information regarding the position of a rectangle surrounding a window in which particular data is to be presented, and means for providing signals representing the relations between the boundaries of the new position of said block of data and the boundaries of said rectangle.
Claim 37
Dependent Claim
67 words
A graphics accelerator circuit as claimed in claim 35 further comprising means for determining whether a particular graphics operation is to be performed by said graphics accelerator circuit wherein said means operates in response to the signals provided by said means for providing signals representing the relations between each of the boundaries of the new position of said block of data and the boundaries of said rectangl
Claim 38
Dependent Claim
32 words
A graphics accelerator circuit as claimed in claim 36 further comprising means for presenting scan line information in scan line order no matter what direction the decomposition of said quadrilateral has proceeded.
Claim 39
Dependent Claim
35 words
A graphics accelerator circuit as claimed in claim 29 in which the means for translating said coordinates into scan line information comprises means for translating said coordinates into a number of distinct resolutions for display.
Claim 40
Dependent Claim
62 words
A graphics accelerator circuit as claimed in claim 29 further comprising means for receiving information regarding the position of a rectangle surrounding a window in which said block of data is to be presented, and means for providing signals representing the relations between each of the boundaries of the new position of said block of data and the boundaries of said rectangle.
Claim 41
Dependent Claim
32 words
A graphics accelerator circuit as claimed in claim 29 further comprising circuitry for clipping said block of data to fit within a particular window to be displayed on said computer output display.
Claim 42
Dependent Claim
42 words
A graphics accelerator circuit as claimed in claim 40 in which said circuitry for clipping said block of data comprises means for determining whether a particular scan line of information to be displayed in said particular window lies within said particular window.
Claim 43
Dependent Claim
59 words
A graphics accelerator circuit as claimed in claim 40 in which said circuitry for clipping said block of data comprises means for comparing the horizontal values of said block on each scan line to be displayed in said particular window with the left and right edges of the window to determine if the values lies within said particular window.
Claim 44
Dependent Claim
20 words
A graphics accelerator circuit as claimed in claim 42 in which said first number format is an integer number format.
Claim 45
Dependent Claim
21 words
A graphics accelerator circuit as claimed in claim 42 in which said first number format is a floating point number format.
Claim 46
Dependent Claim
20 words
A graphics accelerator circuit as claimed in claim 42 in which said first number format is a FRACT number format.
Claim 47
Dependent Claim
61 words
A graphics accelerator circuit as claimed in claim 29 further comprising means for translating numbers in a first number format to numbers stated in an internal number format, means for manipulating numbers based in the internal number format utilizing conventional matrix transformation operations, and means for translating numbers stated in the internal number format into numbers in the first number format.
Claim 48
Dependent Claim
124 words
A graphics accelerator circuit as claimed in claim 46 in which said means for translating numbers in a first number format to numbers stated in an internal number format comprises means for translating numbers in a first number format to numbers stated in Modulo 256 with multiple tap points number format, said means for manipulating numbers based in an internal number format comprises means for manipulating numbers based in Modulo 256 with multiple tap point format utilizing conventional matrix transformation operations, and in which said means for translating numbers stated in the internal number format into numbers in the first number format comprises means for translating numbers stated in Modulo 256 with multiple tap points number format into numbers in the first number format.
Claim 49
Dependent Claim
25 words
A graphics accelerator circuit as claimed in claim 29 in which said interface means comprises means for receiving said graphics information both synchronously and asynchronously.
Claim 50
Dependent Claim
28 words
A graphics accelerator circuit as claimed in claim 29 further comprising means for determining whether a particular graphics operation is to be accomplished by said graphics accelerator circuit.
Claim 51
Dependent Claim
49 words
A graphics accelerator circuit as claimed in claim 49 in which said means for determining whether a particular graphics operation is to be accomplished comprises a status register having at least one bit position representing whether a particular graphics operation is to be accomplished by said graphics accelerator circuit.
Claim 52
Dependent Claim
69 words
A graphics accelerator circuit as claimed in claim 50 in which said status register further includes a plurality of bit positions representing exceptions which preclude said graphics accelerator circuit from accomplishing a particular graphics operation, and means for ORing the bits in said bit positions representing exceptions into said at least one bit position representing whether a particular graphics operation is to be accomplished by said graphics accelerator circuit.
Claim 53
Dependent Claim
25 words
A graphics accelerator circuit as claimed in claim 51 further comprising means for transferring said precluded graphics operations to an associated precessor to be conducted.
Claim 54
Dependent Claim
59 words
A graphics accelerator circuit as claimed in claim 49 in which said means for determining whether a particular graphics operation is to be accomplished by said graphics accelerator circuit operates in response to the signals provided by said means for providing signals representing the relations between each of said vertices of said quadrilateral and the boundaries of said rectangle.
Claim 55
Dependent Claim
40 words
A graphics accelerator circuit as claimed in claim 49 further comprising means for testing the condition of said at least one bit position of said status register and launching a graphics operation if that bit does not indicate an exception.
Claim 56
Dependent Claim
33 words
A graphics accelerator circuit as claimed in claim 1 wherein said interface means further comprises means for storing the address and data regarding a figure to be displayed on said computer output display.
Claim 57
Dependent Claim
46 words
A graphics accelerator circuit as claimed in claim 55 in which said means for storing the address and data comprises means for storing the scan line on which said data is to appear, and means for storing the position of said data on such scan line.
Claim 58
Dependent Claim
54 words
A graphics accelerator circuit as claimed in claim 55 further comprising means for receiving information regarding the position of a window on said computer output display in which said figure is to be presented, and means for providing signals representing the relations between the position of said figure and the boundaries of said window.
Claim 59
Dependent Claim
52 words
A graphics accelerator circuit as claimed in claim 55 further comprising means for receiving information regarding the position of a rectangle surrounding a window in which said figure is to be presented, and means for providing signals representing the relations between the position of said figure and the boundaries of said rectangle.
Claim 60
Dependent Claim
59 words
A graphics accelerator circuit as claimed in claim 55 further comprising means for determining whether a particular graphics operation is to be accomplished by said graphics accelerator circuit, wherein said means operates in response to the signals provided by said means for providing signals representing the relations between the position of said figure and the boundaries of said rectangle.
Claim 61
Dependent Claim
31 words
A graphics accelerator circuit as claimed in claim 55 in which said means for translating said coordinates comprises means for translating said coordinates into a number of distinct resolutions for display.
Claim 62
Dependent Claim
30 words
A graphics accelerator circuit as claimed in claim 55 further comprising circuitry for clipping said figure to fit within a particular window to be displayed on said computer output display.
Claim 63
Dependent Claim
38 words
A graphics accelerator circuit as claimed in claim 61 in which said circuitry for clipping comprises means for determining whether a particular scan line of information to be displayed in said particular window lies within said particular window.
Claim 64
Dependent Claim
55 words
A graphics accelerator circuit as claimed in claim 61 in which said circuitry for clipping comprises means for comparing the horizontal values of said figure on each scan line to be displayed in said particular window with the left and right edges of the window to determine if the value lies within said particular window.
Claim 65
Dependent Claim
61 words
A graphics accelerator circuit as claimed in claim 55 further comprising means for translating numbers in a first number format to numbers stated in an internal number format, means for manipulating numbers based in the internal number format utilizing conventional matrix transformation operations, and means for translating numbers stated in the internal number format into numbers in the first number format.
Claim 66
Dependent Claim
124 words
A graphics accelerator circuit as claimed in claim 64 in which said means for translating numbers in a first number format to numbers stated in an internal number format comprises means for translating numbers in a first number format to numbers stated in Modulo 256 with multiple tap points number format, said means for manipulating numbers based in an internal number format comprises means for manipulating numbers based in Modulo 256 with multiple tap point format utilizing conventional matrix transformation operations, and in which said means for translating numbers stated in the internal number format into numbers in the first number format comprises means for translating numbers stated in Modulo 256 with multiple tap points number format into numbers in the first number format.
Claim 67
Dependent Claim
20 words
A graphics accelerator circuit as claimed in claim 64 in which said first number format is an integer number format.
Claim 68
Dependent Claim
21 words
A graphics accelerator circuit as claimed in claim 64 in which said first number format is a floating point number format.
Claim 69
Dependent Claim
20 words
A graphics accelerator circuit as claimed in claim 64 in which said first number format is a FRACT number format.
Claim 70
Dependent Claim
24 words
A graphics accelerator circuit as claimed in claim 64 in which said interface means comprises means for receiving graphics information both synchronously and asynchronously.
Claim 71
Dependent Claim
28 words
A graphics accelerator circuit as claimed in claim 1 further comprising means for determining whether a particular graphics operation is to be accomplished by said graphics accelerator circuit.
Claim 72
Dependent Claim
54 words
A graphics accelerator circuit as claimed in claim 70 in which said means for determining whether a particular graphics operation is to be accomplished by said graphics accelerator circuit comprises a status register having at least one bit position representing whether a particular graphics operation is to be accomplished by said graphics accelerator circuit.
Claim 73
Dependent Claim
69 words
A graphics accelerator circuit as claimed in claim 71 in which said status register further includes a plurality of bit positions representing exceptions which preclude said graphics accelerator circuit from accomplishing a particular graphics operation, and means for ORing the bits in said bit positions representing exceptions into said at least one bit position representing whether a particular graphics operation is to be accomplished by said graphics accelerator circuit.
Claim 74
Dependent Claim
25 words
A graphics accelerator circuit as claimed in claim 72 further comprising means for transferring said precluded graphics operations to an associated processor to be conducted.
Claim 75
Dependent Claim
59 words
A graphics accelerator circuit as claimed in claim 73 in which said means for determining whether a particular graphics operation is to be accomplished by said graphics accelerator circuit operates in response to the signals provided by said means for providing signals representing the relations between each of said vertices of said quadrilateral and the boundaries of said rectangle.
Claim 76
Dependent Claim
40 words
A graphics accelerator circuit as claimed in claim 70 further comprising means for testing the condition of said at least one bit position of said status register and launching a graphics operation if that bit does not indicate an exception.
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-10-27 | 1996-04-27 | 1996-10-27 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1999-10-27 | 2000-04-27 | 2000-10-27 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2003-10-27 | 2004-04-27 | 2004-10-27 | $7700.00 | Window Closed / Lapsed |