 |
|
|
|
|
|
 Title: |
US5825369:
Compression of simple geometric models using spanning trees
[ Derwent Title ]
|
| Country: |
US United States of America
|
| |
| Inventor: |
Rossignac, Jarek Jaroslaw Roman; Cronton-on-Hudson, NY
Taubin, Gabriel; Hartsdale, NY
|
| Assignee: |
International Business Machines Corporation, Armonk, NY
other patents from INTERNATIONAL BUSINESS MACHINES CORPORATION (280070) (approx. 44,393)
News, Profiles, Stocks and More about this company
|
| Published / Filed: |
1998-10-20
/ 1996-07-30
|
| Application Number: |
US1996000688572
|
| IPC Code: |
Advanced:
G06T 9/40;
Core:
more...
IPC-7:
G06F 15/00;
|
| ECLA Code: |
G06T9/40;
|
| U.S. Class: |
Current:
345/440;
Original:
345/440;
|
| Field of Search: |
345/440,441,442,443,133,118
|
| Priority Number: |
| 1996-07-30 |
US1996000688572 |
| 1996-01-16 |
US1996000010045P |
|
| Abstract: |
A computer system stores and transmits compressed simple triangular meshes. The computer uses a data structure that represents a simple triangular mesh in n-dimensional space. The data structure has a table of vertex runs, a table of triangle runs, zero or more marching records, which provide the connectivity information of the triangular mesh. The data structure also has zero or more associated data records that include the geometric information of the triangular mesh. The table of triangle runs and the marching record have information that describes how to construct a triangular mesh (therefore, the polygon vertices and the boundary edges). The table of vertex runs describes a vertex spanning tree that provides additional connectivity information to construct the triangular mesh from the polygon. The associated data record determines the exact position of the triangular mesh in space. The system also includes ways for creating this data structure from a simple triangular mesh, transmitting this information between computers, and compressing and decompressing this transmitted information.
|
| Attorney, Agent or Firm: |
Percello, Louis J. ;
|
| Primary / Asst. Examiners: |
Nguyen, Phu K.;
|
| INPADOC Legal Status: |
Show legal status actions
Family Legal Status Report
|
| Family: |
Show 8 known family members
|
First Claim:
Show all 38 claims |
We claim:
1. A data structure in a computer memory representing a set of points of a n-dimensional space, the data structure comprising:
- a table of runs describing a rooted tree, the rooted tree having one or more nodes, each node being a regular node, a branching node, or a leaf node, each node of the rooted tree represents a point of the n-dimensional space, the table of runs having one or more records, each record representing a run of the rooted tree, a run having a first node that is a leaf or branching node and a last node that is a leaf or branching node and the run connecting one or more regular nodes between the first node and the last node where the connection between every pair of consecutive nodes in the run is an edge, each record having a length of run field in terms of the number of edges in the run, a leaf field indicating if the run ends at a leaf node, and a last run field indicating if the run represented by the record is the last one with the same first node in the rooted tree, the records given by an order of tree traversal with respect to the root node.
|
| Background / Summary: |
Show background / summary
|
| Drawing Descriptions: |
Show drawing descriptions
|
| Description: |
Show description
|
| Forward References: |
Show 22 U.S. patent(s) that reference this one
|
