Single-resolution compression of arbitrary triangular meshes with properties
- 1 January 1999
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 247-256
- https://doi.org/10.1109/dcc.1999.755674
Abstract
We propose a new layering structure to partition an arbitrary triangular mesh (no-manifold and arbitrary-genus) into generalized triangle strips. An efficient and flexible encoding of the connectivity, vertex coordinates and attribute data yields excellent single-resolution compression. This scheme gracefully solves the "crack" problem and also prevents error propagation while providing efficient prediction coding for both geometry and photometry data such as positions, color, normal, and texture coordinates. We present an encoder and decoder. We introduce a layering scheme to partition input data, we address the coding of connectivity and geometry, and discuss the attribute coding. Experimental results are presented.Keywords
This publication has 8 references indexed in Scilit:
- Optimized geometry compression for real-time renderingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Progressive compression of 3D graphic modelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Arithmetic coding revisitedPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Geometric compression through topological surgeryACM Transactions on Graphics, 1998
- Geometry compressionPublished by Association for Computing Machinery (ACM) ,1995
- The JPEG still picture compression standardCommunications of the ACM, 1991
- MPEGCommunications of the ACM, 1991
- A Method for the Construction of Minimum-Redundancy CodesProceedings of the IRE, 1952