ACM Home Page
Please provide us with feedback. Feedback
Geometry-guided progressive lossless 3D mesh coding with octree (OT) decomposition
Full text MovMov (22:44),  PdfPdf (592 KB)
Source ACM Transactions on Graphics (TOG) archive
Volume 24 ,  Issue 3  (July 2005) table of contents
Proceedings of ACM SIGGRAPH 2005
SESSION: Meshes II table of contents
Pages: 609 - 616  
Year of Publication: 2005
ISSN:0730-0301
Also published in ...
Authors
Jingliang Peng  University of Southern California
C.-C. Jay Kuo  University of Southern California
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 103,   Citation Count: 5
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1073204.1073237
What is a DOI?

ABSTRACT

A new progressive lossless 3D triangular mesh encoder is proposed in this work, which can encode any 3D triangular mesh with an arbitrary topological structure. Given a mesh, the quantized 3D vertices are first partitioned into an octree (OT) structure, which is then traversed from the root and gradually to the leaves. During the traversal, each 3D cell in the tree front is subdivided into eight childcells. For each cell subdivision, both local geometry and connectivity changes are encoded, where the connectivity coding is guided by the geometry coding. Furthermore, prioritized cell subdivision is performed in the tree front to provide better rate-distortion (RD) performance. Experiments show that the proposed mesh coder outperforms the kd-tree algorithm in both geometry and connectivity coding efficiency. For the geometry coding part, the range of improvement is typically around 10%~20%, but may go up to 50%~60% for meshes with highly regular geometry data and/or tight clustering of vertices.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
Alliez, P., and Desbrun, M. 2001. Valence-driven connectivity encoding for 3D meshes. In EUROGRAPHICS, 480--489.
 
3
Alliez, P., and Gotsman, C. 2003. Recent advance in compression of 3d meshes. In Proceedings of the Symposium on Multiresolution in Geometric Modeling.
4
 
5
 
6
Bajaj, C. L., Pascucci, V., and Zhuang, G. 1999. Single resolution compression of arbitrary triangular meshes with properties. Computational Geometry: Theory and Applications 14, 167--186.
 
7
 
8
 
9
 
10
11
 
12
Gotsman, C., Gumhold, S., and Kobbelt, L. 2002. Simplification and compression of 3D meshes. In Tutorials on Multiresolution in Geometric Modelling.
13
14
 
15
 
16
Khodakovsky, A., and Guskov, I. 2000. Normal mesh compression. Preprint.
 
17
 
18
Laney, D., Bertram, M., Duchaineau, M., and Max, N. 2002. Multiresolution distance volumes for progressive surface compression. In Proceedings of the First International Symposium on 3D Data Processing, Visualization, and Transmission, 470--479.
 
19
Lee, H., Desbrun, M., and Schröder, P. 2003. Progressive encoding of complex isosurfaces. In ACM SIGGRAPH.
 
20
Li, J., and Kuo, C.-C. J. 1998. Progressive coding of 3-D graphic models. Proceedings of the IEEE 86, 6 (Jun), 1052--1063.
 
21
 
22
Peng, J., Kim, C.-S., and Kuo, C.-C. J. Technologies For 3D mesh compression: A survey, to appear in Journal of Visual Communication and Image Representation.
 
23
 
24
Rossignac, J., and Borrel, P. 1993. Geometric Modeling in Computer Graphics. Springer-Verlag, Jul.
 
25
 
26
 
27
 
28
29
30
 
31
Touma, C., and Gotsman, C. 1998. Triangle mesh compression. In Proceedings of Graphics Interface, 26--34.


Collaborative Colleagues:
Jingliang Peng: colleagues
C.-C. Jay Kuo: colleagues