US5454068A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Scientific visualization system
Assignee: Pendragon Networks LLC
•
Filing: 1994-04-04
•
Granted: 1995-09-26
•
Expires: 2014-04-04
Abstract
Abstract A 3D scientific visualization system for viewing models composed of polyhedra or other elements having vertices at which analysis results (e.g., temperature or pressure) are defined. The model is viewed either in a cutting plane or as a contour surface in which a given result assumes a specified value. Polygons making up an intersection surface formed by the intersection of the cutting plane or contour surface with the polyhedra forming the model are generated and passed to a polygon processor for rendering and display on a raster-scan device. A series of intersection surfaces are generated for display by varying either the position of the cutting plane along its normal or the value that the result assumes on the contour surface. The testing of elements for possible intersection by the cutting plane or contour surface is speeded up by presorting the elements into zones, based upon either the position of each element along the cutting plane normal or the value of the result over the vertices of the element, and testing only elements within certain zones for intersection with the plane or surface. Intersection calculations for edges shared by multiple elements are minimized by maintaining a global list of edges and flagging those edges whose intersection point with the cutting plane or contour surface has been calculated for any element of the model. The outer surfaces are identified for viewing in an alternative mode of operation by counting the elements sharing a given face of the model and flagging as outer faces those faces associated with only a single element.
Inventors
- 👤 Gopalan Ramanujam
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 07:25
CPC Classifications
G; G06; G06T; G06T17/00
Claims Analysis
Total Claims: 18
Claim 1
Independent Claim
161 words
A computer graphics visualization system for displaying a representation of a graphics model intersected by a surface on a two dimensional display device, the system operating on a computer system having a processor, storage means and a display device, the graphics model comprised of a plurality of polyhedral elements defined by a plurality of vertices each having coordinates in three-dimensional space and each having assigned at least one variable, the system comprising: means for grouping said polyhedral elements into a plurality of element zones based upon a first value associated with said surface; selection means for selecting a subset of zones; means for testing each of said polyhedral elements to determine whether or not said polyhedral element is intersected by said surface; means for generating coordinates and variable values for each intersection of said surface and said intersected elements; means for generating a two dimensional figure from said coordinates; and means for displaying said two dimensional figure on said display device.
Claim 2
Dependent Claim
161 words
A computer graphics visualization system for displaying a representation of a graphics model intersected by a surface on a two dimensional display device, the system operating on a computer system having a processor, storage means and a display device, the graphics model comprised of a plurality of polyhedral elements defined by a plurality of vertices each having coordinates in three-dimensional space and each having assigned at least one variable, the system comprising: means for grouping said polyhedral elements into a plurality of element zones based upon a first value associated with said surface; selection means for selecting a subset of zones; means for testing each of said polyhedral elements to determine whether or not said polyhedral element is intersected by said surface; means for generating coordinates and variable values for each intersection of said surface and said intersected elements; means for generating a two dimensional figure from said coordinates; and means for displaying said two dimensional figure on said display device.
Claim 3
Dependent Claim
45 words
The system of claim 1 wherein said first value is a constant value in said three dimensional coordinate space, and wherein said means for testing tests whether said constant surface value lies between values of said at least one variable at vertices of said element.
Claim 4
Dependent Claim
28 words
The system of claim 2 wherein said means for generating determines the intersection of said surface and said element by interpolating between the coordinates of said element vertices.
Claim 5
Dependent Claim
30 words
The system of claim 1, wherein each of said element vertices has at least two variables and wherein said means for generating generates a second variable value at each intersection.
Claim 6
Dependent Claim
46 words
The system of claim 1 wherein said first value is a value of one of said at least one variable and wherein said means for testing determines whether said surface variable value lies between values of said at least one variable at vertices of said element.
Claim 7
Dependent Claim
33 words
The system of claim 5 wherein said means for generating determines the intersection of said surface and said element by interpolating between the values of said at least one variable at said vertices.
Claim 8
Independent Claim
169 words
A method for displaying an image of an intersection between a surface having a first value and a three dimensional model made up of a plurality of polyhedral elements each having vertices defined as coordinate values in a three dimensional space, each of said vertices having at least one variable value, the method comprising the steps of: creating a plurality of zones based upon said first value and said coordinate values and at least one variable value of said polyhedral elements; associating each of said plurality of polyhedral elements with at least one of a plurality of zones based on said polyhedral element vertices coordinate values and said at least one variable value; selecting a subset of said zones based upon said first value; testing the polyhedral elements associated with each of said subset of zones to identify elements intersecting said surface; generating an intersection value for each of said intersecting elements; generating an intersection image from said intersection values; and displaying said intersection image on a display device.
Claim 9
Independent Claim
169 words
A method for displaying an image of an intersection between a surface having a first value and a three dimensional model made up of a plurality of polyhedral elements each having vertices defined as coordinate values in a three dimensional space, each of said vertices having at least one variable value, the method comprising the steps of: creating a plurality of zones based upon said first value and said coordinate values and at least one variable value of said polyhedral elements; associating each of said plurality of polyhedral elements with at least one of a plurality of zones based on said polyhedral element vertices coordinate values and said at least one variable value; selecting a subset of said zones based upon said first value; testing the polyhedral elements associated with each of said subset of zones to identify elements intersecting said surface; generating an intersection value for each of said intersecting elements; generating an intersection image from said intersection values; and displaying said intersection image on a display device.
Claim 10
Dependent Claim
56 words
A method as in claim 7 in which said elements are defined by a stored data structure, said step of associating said elements with zones including the step of generating a zone array containing a plurality of entries corresponding to respective zones, each of said entries containing a pointer to each element associated with said zone.
Claim 11
Dependent Claim
32 words
The method of claim 7, in which each of said vertices has two variable values and wherein the method includes the further step of evaluating said second variable value at said intersections.
Claim 12
Dependent Claim
20 words
The method of claim 9 wherein the interpolated value of the second variable is used to shade said visualized image.
Claim 13
Dependent Claim
27 words
The method of claim 7 wherein the step of generating an intersection value is accomplished by interpolating between the values of the vertices of said intersecting elements.
Claim 14
Dependent Claim
22 words
The method of claim 7 wherein the first value is a constant value of one of said at lease one variable value.
Claim 15
Dependent Claim
21 words
The method of claim 7 wherein the first value is a constant value defining a plane in said three dimensional space.
Claim 16
Dependent Claim
60 words
The method of claim 13 further comprising the steps of: converting the vertex coordinate values to coordinates in a transformed XYZ coordinate space so that said plane is coplanar with the Z plane in said coordinate space; determining the maximum Z variation over the set of elements in said model; defining said zones in accordance with said maximum Z variation.
Claim 17
Independent Claim
437 words
A method of displaying on a two dimensional display, the intersection of a surface having a surface value and a plurality of polyhedra, said plurality of polyhedra each defined in a three dimensional geometric coordinate space, said polyhedra each having faces and vertices connected by edges, comprising the steps of: storing said plurality of polyhedra in the storage media of a computer system, said storing step creating in said storage media a first list containing an entry for each of said plurality of polyhedra, a second list containing an entry having endpoint coordinates for each of said edges, and a third list containing an entry having coordinates and a result value for each vertex of Said polyhedra, said first, second and third lists containing pointers to each of the other lists that associate each of said edges and each of said vertices with the one or more of said plurality of polyhedra to which it belongs; storing in said storage media a fourth list containing a zone entry for each of a plurality of zone, each of said zone entries having a zone range and pointing to a list of zone entries; testing said surface value to determine whether it is a coordinate value or results value; if said surface value is a coordinate value, testing each edge of each of said polyhedra against each of said zone ranges and adding an entry for each of said polyhedra to one or more of said lists of zone entries based on the testing result; if said surface value is a results value, testing each vertex of each of said polyhedra against said zone ranges and adding an entry for each of said polyhedra to one or more of said lists of zone entries based on the testing result; testing said surface value against said zone ranges to determine a selected zone into which said surface value falls; for each polyhedron in said selected zone performing the following steps: selecting a first intersection point at which said surface intersects a first edge of the polyhedron; selecting a second intersection point at which said surface intersects a second edge of a face of the polyhedron containing the first edge; generating a first side of an intersection polyline from said first and second points; storing said first side in said storage media; repeating the above steps, each time selecting the previous second intersection point as the new first intersection point, generating a next side, and triangulating the polyline formed by the added side, until all edges of said polyhedron have been processed and displaying the intersection polyline on a display device.
Claim 18
Independent Claim
437 words
A method of displaying on a two dimensional display, the intersection of a surface having a surface value and a plurality of polyhedra, said plurality of polyhedra each defined in a three dimensional geometric coordinate space, said polyhedra each having faces and vertices connected by edges, comprising the steps of: storing said plurality of polyhedra in the storage media of a computer system, said storing step creating in said storage media a first list containing an entry for each of said plurality of polyhedra, a second list containing an entry having endpoint coordinates for each of said edges, and a third list containing an entry having coordinates and a result value for each vertex of Said polyhedra, said first, second and third lists containing pointers to each of the other lists that associate each of said edges and each of said vertices with the one or more of said plurality of polyhedra to which it belongs; storing in said storage media a fourth list containing a zone entry for each of a plurality of zone, each of said zone entries having a zone range and pointing to a list of zone entries; testing said surface value to determine whether it is a coordinate value or results value; if said surface value is a coordinate value, testing each edge of each of said polyhedra against each of said zone ranges and adding an entry for each of said polyhedra to one or more of said lists of zone entries based on the testing result; if said surface value is a results value, testing each vertex of each of said polyhedra against said zone ranges and adding an entry for each of said polyhedra to one or more of said lists of zone entries based on the testing result; testing said surface value against said zone ranges to determine a selected zone into which said surface value falls; for each polyhedron in said selected zone performing the following steps: selecting a first intersection point at which said surface intersects a first edge of the polyhedron; selecting a second intersection point at which said surface intersects a second edge of a face of the polyhedron containing the first edge; generating a first side of an intersection polyline from said first and second points; storing said first side in said storage media; repeating the above steps, each time selecting the previous second intersection point as the new first intersection point, generating a next side, and triangulating the polyline formed by the added side, until all edges of said polyhedron have been processed and displaying the intersection polyline on a display device.
References Cited (Backward Citations)
US3889107A
Cited
US4631690A
Cited
US4757461A
Cited
US4788399A
Cited
US4685070A
Cited
US4766556A
Cited
US4775946A
Cited
US4812988A
Cited
US4862391A
Cited
US4855934A
Cited
US4821210A
Cited
US4888712A
Cited
US4958305A
Cited
US4897805A
Cited
US5067101A
Cited
US5101363A
Cited
US5309550A
Cited
US5113490A
Cited
US5222202A
Cited
US5150457A
Cited
US5201035A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1998-09-25 | 1999-03-27 | 1999-09-26 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2002-09-25 | 2003-03-27 | 2003-09-26 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2006-09-25 | 2007-03-27 | 2007-09-26 | $7700.00 | Window Closed / Lapsed |