 |
|
|
|
|
|
 Title: |
US6009435:
Progressive compression of clustered multi-resolution polygonal models
[ Derwent Title ]
|
| Country: |
US United States of America
|
| |
| Inventor: |
Taubin, Gabriel; Hartsdale, NY
Horn, William Pettit; Scarsdale, NY
Borrel, Paul; Cortlandt Manor, 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: |
1999-12-28
/ 1997-11-21
|
| Application Number: |
US1997000976247
|
| IPC Code: |
Advanced:
G06T 9/00;
Core:
more...
IPC-7:
G06F 15/00;
|
| ECLA Code: |
G06T9/00F;
|
| U.S. Class: |
Current:
707/101;
345/420;
345/423;
345/428;
Original:
707/101;
345/420;
345/423;
345/428;
|
| Field of Search: |
707/101
345/440,423,443,420,425,428
|
| Priority Number: |
| 1997-11-21 |
US1997000976247 |
|
| Abstract: |
A computer system progressively stores and transmits compressed clustered multi-resolution polygonal models. The computer uses a data structure that represents a clustered multi-resolution polygonal model in n-dimensional space. The data structure has a connectivity record which encodes the connectivity information of the highest level of detail. The data structure also has a clustering record which encodes how the vertices of each level of detal are clustered to obtain the vertices of the next lower level of detail. The clustering record is organized in decreasing order of level of detail. The data structure also has a data record with information describing the vertex positions of the levels of detail, and optionally the corresponding properties. The fields of the data record are organized in increasing order of level of detail. The system also includes ways for creating this data structure from a clustered multi-resolution polygonal model, transmitting this information between computers, and compressing and decompressing this transmitted information.
|
| Attorney, Agent or Firm: |
Percello, Louis J. ;
|
| Primary / Asst. Examiners: |
Homere, Jean R.;
|
| INPADOC Legal Status: |
Show legal status actions
|
| Family: |
None
|
First Claim:
Show all 17 claims |
I claim:
1. A system for compressing a clustered multi-resolution polygonal model comprising:
- a memory containing a polygonal model with two or more levels of detail with progressively more resolution, each level of detail having a plurality of vertices forming a plurality of triangles, each level of detail having a geometric information about the position of the vertices in space and each level of detail having a connectivity information about the association between each triangle and the vertices that form the triangle, the memory further having a clustering information for each level of detail about how a plurality of sets of vertices in each level of detail are clustered and how each of the respective clusters correspond to a vertex in a level of detail with a next lower resolution;
- a central processing unit (CPU);
- a connectivity process, executed by the CPU, that identifies the connectivity information of a highest resolution level of detail;
- a clustering process, executed by the CPU, that orders the clustering information for each level of detail, from the level of detail with the highest resolution to the level of detail with the lowest resolution, where the clustering information is compressed by a clustering compression process having the following steps:
- first, determining a connectivity preserving partition of the vertices of the level of detail into one or more connected clusters, with two vertices joined by an edge of the level of detail belonging to the same connected cluster if the clustering information determines that the two vertices are clustered into the same set, and
- second, determining an anti-connectivity partition of the connected clusters into one or more sets of connected clusters, with two connected clusters belonging to the same set of connected clusters if the clustering information determines that the vertices that belong to the two connected clusters are clustered into the same set; and
- a geometry process, executed by the CPU, that orders the geometric information of each level of detail from the level of detail with lowest resolution to the level of detail with highest resolution.
|
| Background / Summary: |
Show background / summary
|
| Drawing Descriptions: |
Show drawing descriptions
|
| Description: |
Show description
|
| Forward References: |
Show 27 U.S. patent(s) that reference this one
|
|
|
|
|
|
|
| Foreign References: |
|
| Other Abstract Info: |
DERABS G2000-105435
DERABS G2000-105435
|
| Other References: |
Hugues, H., "Progressive meshes", Proceedings of the ACM SIGGRAPH conference on computer graphics, Abstract Only, Aug. 1996.
De Floriani, et al., "Hierarchical triangulation for multiresolution surface description", ACM transactions on Graphics, vol. 4, No. 4, Abstract Only, Oct. 1995.
J. D. Foley, A. van Dam, S. K. Feiner and J. F. Hughes, Computer Graphics Principles and Practice, Addison-Wesley, 1990, pp. 471-477.
R. E. Tarjan, Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983, pp. 14-21.
P. Heckbert, Multiresolution Surface Modeling, Course Notes for SIGGRAPH '97, Los Angeles, Ca., Aug. 5, 1997, pp. 1-4.
M. Deering, Geometry Compression, Sun Microsystems, ACM-O-89791-701 4/95/008, pp. 13-20.
H. Hoppe, "Progressive Meshes", Microsoft Research, ACM-0-89791-746-4/96/008, pp. 99-108.
J. Popovic and H. Hoppe, "Progressive Simplicial Complexes", Carnegie Mellon U. and Microsoft Research, ACM-0-89791-896-7/97/008, pp. 217-224.
|
|
 Nominate this for the Gallery...
|
|
