 |
|
|
|
|
|
 Title: |
US6445389:
Compression of polygonal models with low latency decompression
[ Derwent Title ]
|
| Country: |
US United States of America
|
| |
| Inventor: |
Bossen, Frank J.; Plan-les-Ouates, Switzerland
Gueziec, Andre P.; Sunnyvale, CA
Silva, Claudio T.; Mahwah, NJ
Taubin, Gabriel; Hartsdale, NY
|
| Assignee: |
International Business Machines Corp., Armonk, NY
other patents from INTERNATIONAL BUSINESS MACHINES CORPORATION (280070) (approx. 44,393)
News, Profiles, Stocks and More about this company
|
| Published / Filed: |
2002-09-03
/ 1999-10-01
|
| Application Number: |
US1999000411448
|
| IPC Code: |
Advanced:
G06T 17/20;
Core:
more...
IPC-7:
G06T 17/00;
|
| ECLA Code: |
G06T17/20;
|
| U.S. Class: |
345/420;
|
| Field of Search: |
345/418,419,420,421,422
|
| Priority Number: |
| 1999-10-01 |
US1999000411448 |
| 1998-10-06 |
US1998000103257P |
|
| Abstract: |
A data structure for representing a general n-dimensional polygonal mesh. The data structure includes a structure record and a data record for each three dimensional shape. The structural record contains polygonal model connectivity information and further includes a stitching record that defines corresponding polygonal (triangular) mesh edge pairs and a polygonal (triangular) tree record representing a polygon (triangle) tree. The stitching record includes a vertex tree and a set of jump edges. The data record includes at least three polygonal records, each corresponding to a polygon. Each polygonal record is associated with a face of said polygonal model and classifies its corresponding polygon as either a leaf polygon, a running polygon or a branching polygon. Polygonal shapes are encoded into the data structure by first building a spanning tree for the polygonal mesh. A set of cut edges are derived for the polygonal mesh. The stitching record is constructed for the set of cut edges. Then traversing the polygon tree, the data records are encoded. The encoded data is transmitted, the structure record being transmitted first, followed by the data record. The stitching tree and polygon tree are decoded as they are received and, after at least three polygons are received, received polygons may be displayed.
|
| Attorney, Agent or Firm: |
Percello, Louis J.Fitch, Even, Tabin & Flannery ;
|
| Primary / Asst. Examiners: |
Vo, Cliff N.;
|
| INPADOC Legal Status: |
Show legal status actions
|
| Parent Case: |
RELATED APPLICATIONS
This application claims priority from provisional application No. 60/103,257, filed Oct. 6, 1998.
The present invention is related to application Ser. No. 08/688,572 filed Jul. 30, 1996, entitled "Compression of Simple Geometric Models Using Spanning Trees", to J. Rossignac and G. Taubin, now issued as U.S. Pat. No. 5,825,369 and application Ser. No. 08/685,422 filed Jul. 30, 1996, entitled "Compression of Geometric Models Using Spanning Trees", to J. Rossignac and G. Taubin, now issued as U.S. Pat. No. 5,905,507, both assigned to the assignee of the present invention and incorporated herein by reference in their entirety.
|
| Family: |
None
|
First Claim:
Show all 19 claims |
We claim:
1. A data structure stored in a memory of a computer system for representing a general n-dimensional polygonal mesh, the data structure comprising:
- a structure record containing polygonal model connectivity information, said structure record further including a stitching record defining corresponding polygonal mesh edge pairs and a polygonal tree record representing a polygon tree; and
- a data record including three or more polygonal records, a corresponding polygon for each said polygonal record being associated with a face of said polygonal model, wherein each of said polygonal records classifies said corresponding polygon as either a leaf polygon, a running polygon or a branching polygon.
|
| Background / Summary: |
Show background / summary
|
| Drawing Descriptions: |
Show drawing descriptions
|
| Description: |
Show description
|
|
