← Back to Patent Explorer
US5821940A Expired / Lapsed US ⏱️ 0.0 years remaining

Computer graphics vertex index cache system for polygons

Assignee: BAE Systems Space & Mission Systems Inc
•
Filing: 1992-08-03
•
Granted: 1998-10-13
•
Expires: 2012-08-03
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract The performance of a computer system displaying polygonal forms is improved by method and apparatus including a cache storage device and related control hardware operating in conjunction with a pipeline graphics display system to reduce or eliminate the redundant matrix transformation of shared vertex data, thereby reducing the processing time required to generate the graphics images displayed for out-the-window simulation.

Inventors

  • 👤 Craig R. Morgan
  • 👤 Steven Scott Reed

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-02 16:57
CPC Classifications
G; G06; G06T; G06T17/00; G06F; G06F15/00; G06F15/02

Claims Analysis

Total Claims: 26
Claim 1
Independent Claim 76 words
An apparatus for reducing redundant matrix transformation of shared polygonal vertex data in a computer graphics system, comprising: means for transforming original vertex data into world space data; means for storing said world space data; means for identifying a shared vertex; and means for retrieving stored world space data corresponding to said shared vertex and supplying the retrieved world space data corresponding to said shared vertex to a display means when said shared vertex is identified.
Claim 2
Independent Claim 76 words
An apparatus for reducing redundant matrix transformation of shared polygonal vertex data in a computer graphics system, comprising: means for transforming original vertex data into world space data; means for storing said world space data; means for identifying a shared vertex; and means for retrieving stored world space data corresponding to said shared vertex and supplying the retrieved world space data corresponding to said shared vertex to a display means when said shared vertex is identified.
Claim 3
Dependent Claim 32 words
The apparatus of claim 1 wherein said means for identifying a shared vertex generates an index value for each shared vertex corresponding to a location where said world space data are stored.
Claim 4
Dependent Claim 27 words
The apparatus of claim 1 wherein said means for transforming vertex data comprises means for performing a matrix transformation of said vertex data into world space data.
Claim 5
Dependent Claim 16 words
The apparatus of claim 3 wherein said vertex data comprises X, Y, and Z vertex coordinates.
Claim 6
Dependent Claim 18 words
The apparatus of claim 1 wherein said means for storing said world space data comprises cache storage means.
Claim 7
Dependent Claim 83 words
The apparatus of claim 5 wherein said cache storage means comprises: a cache memory device for storing said world space data; control means coupled to said cache memory device for retrieving said world space data stored in said memory cache device and transferring said world space data to bus means; and buffer means having an input port for latching world space data received from said bus means and having an output port for transferring said world space data to to said display means.
Claim 8
Dependent Claim 55 words
The apparatus of claim 6 wherein said control means further comprises: index means for receiving an index value from a first memory means and for supplying said index value to an address port of said cache memory device; and control block means for controlling said index means, said cache memory device, and said buffer means.
Claim 9
Dependent Claim 12 words
The apparatus of claim 1 wherein said vertex data comprises vertex coordinates.
Claim 10
Dependent Claim 19 words
The apparatus of claim 8 wherein said world space data comprises world space coordinates corresponding to said vertex coordinates.
Claim 11
Independent Claim 147 words
An apparatus for improving the performance of a computer graphics system displaying polygonal forms, comprising: processing means for generating vertex data associated with a polygon, assigning an index value to a vertex shared by a plurality of polygons, and storing said vertex data and said index value in a first memory device; display list control means for sequentially retrieving said vertex data and said index values from said first memory device; transformation means for converting said vertex data into world space data; cache storage means for storing said world space data in a second memory device, for retrieving world space data corresponding to said shared vertex from said second memory device each time an index value stored in said first memory device is retrieved by said display list control means and for transferring said world space data retrieved from said second memory device to a display means.
Claim 12
Independent Claim 147 words
An apparatus for improving the performance of a computer graphics system displaying polygonal forms, comprising: processing means for generating vertex data associated with a polygon, assigning an index value to a vertex shared by a plurality of polygons, and storing said vertex data and said index value in a first memory device; display list control means for sequentially retrieving said vertex data and said index values from said first memory device; transformation means for converting said vertex data into world space data; cache storage means for storing said world space data in a second memory device, for retrieving world space data corresponding to said shared vertex from said second memory device each time an index value stored in said first memory device is retrieved by said display list control means and for transferring said world space data retrieved from said second memory device to a display means.
Claim 13
Dependent Claim 82 words
The apparatus of claim 10 wherein said cache storage means comprises: a cache memory device for storing said world space data; control means coupled to said cache memory device for retrieving said world space data stored in said cache memory device and transferring said world space data to an internal bus; and buffer means having an input port for receiving world space coordinates from said internal bus and having an output port for transferring said world space data to said display means.
Claim 14
Dependent Claim 55 words
The apparatus of claim 11 wherein said control means further comprises: index means for receiving said index value from said first memory means and for supplying said index value to an address port of said cache memory device; and control block means for controlling said index means, said cache memory device, and said buffer means.
Claim 15
Dependent Claim 16 words
The apparatus of claim 10 wherein said vertex data comprises X, Y, and Z vertex coordinates.
Claim 16
Dependent Claim 22 words
The apparatus of claim 13 wherein said transformation processor performs a matrix multiplication of said vertex coordinates to generate world space coordinates.
Claim 17
Independent Claim 76 words
A method for reducing redundant matrix transformation of polygonal vertex data in a computer graphics system, comprising: transforming vertex data into world space data; storing said world space data; identifying a shared vertex that has been transformed into stored world space data; retrieving the previously stored world space data corresponding to said shared vertex when said shared vertex is identified; and supplying said retrieved world space data corresponding to said shared vertex to a display means.
Claim 18
Independent Claim 76 words
A method for reducing redundant matrix transformation of polygonal vertex data in a computer graphics system, comprising: transforming vertex data into world space data; storing said world space data; identifying a shared vertex that has been transformed into stored world space data; retrieving the previously stored world space data corresponding to said shared vertex when said shared vertex is identified; and supplying said retrieved world space data corresponding to said shared vertex to a display means.
Claim 19
Dependent Claim 24 words
The method of claim 15 wherein the step of storing said world space data comprises storing world space data in a cache memory device.
Claim 20
Dependent Claim 41 words
The method of claim 16 wherein said step of identifying a shared vertex further comprises the steps of: receiving an index value from a first memory means; and supplying said index value to an address port of said cache memory device.
Claim 21
Dependent Claim 47 words
The method of claim 17 wherein the step of retrieving world space data further comprises the steps of: retrieving said world space data stored in said cache memory device and transferring said world space data to bus means; latching world space data received from said bus means.
Claim 22
Independent Claim 132 words
A method for improving the performance of a computer graphics system displaying polygonal forms, comprising the steps of: generating vertex data associated with a polygon; assigning an index value to a shared vertex with previously generated vertex data; storing said vertex data and said index value in a first memory device; sequentially retrieving said vertex data and said index values from said first memory device; converting said vertex data into world space data; storing said world space data in a second memory device; retrieving world space data corresponding to said shared vertex from said second memory device each time an index value stored in said first memory device is retrieved by a display list control means; and transferring said world space data retrieved from said second memory device to a display means.
Claim 23
Independent Claim 132 words
A method for improving the performance of a computer graphics system displaying polygonal forms, comprising the steps of: generating vertex data associated with a polygon; assigning an index value to a shared vertex with previously generated vertex data; storing said vertex data and said index value in a first memory device; sequentially retrieving said vertex data and said index values from said first memory device; converting said vertex data into world space data; storing said world space data in a second memory device; retrieving world space data corresponding to said shared vertex from said second memory device each time an index value stored in said first memory device is retrieved by a display list control means; and transferring said world space data retrieved from said second memory device to a display means.
Claim 24
Dependent Claim 18 words
The method of claim 19 wherein said vertex data are stored as X, Y, and Z vertex coordinates.
Claim 25
Dependent Claim 27 words
The method of claim 20 wherein the step of converting said vertex data comprises performing a matrix multiplication of said vertex coordinates to generate world space coordinates.
Claim 26
Dependent Claim 15 words
The method of claim 19 wherein said second memory device comprises a cache memory device.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2001-10-12 2002-04-13 2002-10-13 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2005-10-12 2006-04-13 2006-10-13 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2009-10-12 2010-04-13 2010-10-13 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag