This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Compressed Progressive Meshes
January-March 2000 (vol. 6 no. 1)
pp. 79-93

Abstract—Most systems that support visual interaction with 3D models use shape representations based on triangle meshes. The size of these representations imposes limits on applications for which complex 3D models must be accessed remotely. Techniques for simplifying and compressing 3D models reduce the transmission time. Multiresolution formats provide quick access to a crude model and then refine it progressively. Unfortunately, compared to the best nonprogressive compression methods, previously proposed progressive refinement techniques impose a significant overhead when the full resolution model must be downloaded. The CPM (Compressed Progressive Meshes) approach proposed here eliminates this overhead. It uses a new technique, which refines the topology of the mesh in batches, which each increase the number of vertices by up to 50 percent. Less than an amortized total of 4 bits per triangle encode where and how the topological refinements should be applied. We estimate the position of new vertices from the positions of their topological neighbors in the less refined mesh using a new estimator that leads to representations of vertex coordinates that are 50 percent more compact than previously reported progressive geometry compression techniques.

[1] C.L. Bajaj, V. Pascucci, and G. Zhuang, “Progressive Compression and Transmission of Arbitrary Triangular Meshes,” Proc. Visualization '99, pp. 307-316, 1999.
[2] R. Carey, G. Bell, and C. Martin, “The Virtual Reality Modeling Language ISO/IEC DIS 14772-1,” http://www.vrml.org/Specifications.VRML97 DIS, 1997.
[3] P. Cignoni, C. Montani, D. Rocchini, and R. Scopigno, “Metro: Measuring Error on Simplified Surfaces,” IEEE Computer Graphics Forum, 17, no. 2, pp. 167-174, 1998.
[4] J.G. Cleary, R.M. Neal, and I.H. Witten, “Arithmetic Coding for Data Compression,” Comm. ACM, vol. 30, no. 6, pp. 520-540, June 1987.
[5] D. Cohen-Or, D. Levin, and O. Remez, “Progressive Compression of Arbitrary Triangular Meshes,” Proc. Visualization '99, pp. 67-72, 1999.
[6] M. Deering, “Geometry Compression,” Proc. SIGGRAPH '95, pp. 13-20, 1995.
[7] N. Dyn, D. Levin, and J.A. Gregory, “A Butterfly Subdivision Scheme for Surface Interpolation with Tension Control,” ACM Transactions on Graphics, vol. 9, no. 2, pp. 160-169, Apr. 1990.
[8] T. Funkhouser and C. Sequin, “Adaptive Display Algorithm for Interactive Frame Rates During Visualization of Complex Virtual Environments,” Proc. SIGGRAPH '93, pp. 247-254, 1993.
[9] M. Garland and P.S. Heckbert, "Surface Simplification Using Quadric Error Metrics," Proc. Siggraph 97, ACM Press, New York, 1997, pp. 209-216.
[10] A. Guéziec, F. Bossen, G. Taubin, and C. Silva, “Efficient Compression of Non-Manifold Polygonal Meshes,” Proc. Visualization '99, pp. 73-80, 1999.
[11] S. Gumhold and W. Strasser, “Real Time Compression of Triangle Mesh Connectivity,” Proc. SIGGRAPH '98, pp. 133-140, 1998.
[12] H. Hoppe, T. DeRose, T. Duchamp, J. McDonald, and W. Stuetzle, “Mesh Optimization,” Proc. SIGGRAPH '93, pp. 19-26, 1993.
[13] H. Hoppe, “Efficient Implementation of Progressive Meshes” Technical Report MSR-TR-98-02, Microsoft Research, 1998 (also in SIGGRAPH '98 Course Notes 21 ).
[14] H. Hoppe, “View-Dependent Refinement of Progressive Meshes,” Proc. SIGGRAPH '97, pp. 189-198, 1997.
[15] H. Hoppe, “Progressive Meshes,” Proc. SIGGRAPH '96, pp. 99-108, 1996.
[16] D.A. Huffman, “A Method for the Construction of Minimum Redundancy Codes,” Proc. Inst. of Electrical and Radio Engineers, pp. 1,098-1,101, 1952.
[17] A. Kalvin and R. Taylor, Superfaces: Polygonal Mesh Simplification with Bounded Error IEEE Computer Graphics and Applications, vol. 16, pp. 64-77, May 1996.
[18] D. King and J. Rossignac, “Optimal Bit Allocation in Compressed 3D Models,” Technical Report GIT-GVU-99-07, GVU Center, Georgia Inst. of Tech nology, 1999.
[19] W. Kou, Digital Image Compression: Algorithms and Standards. Norwell,Mass.: Kluwer Academic Publishers, 1995.
[20] D. Luebke and C. Erikson, “View-Dependent Simplification of Arbitrary Polygonal Environments,” Proc. SIGGRAPH '97, pp. 199-208, 1997.
[21] J. Li and C.C. Kuo, “Progressive Coding of 3D Graphics Models,” Proc. IEEE, vol. 96, no. 6, pp. 1,052-1,063, 1998.
[22] J. Neider, T. Davis, and M. Woo, OpenGL Programming Guide. Reading, Mass.: Addison Wesley, 1993.
[23] J. Popovic and H. Hoppe, “Progressive Simplicial Complexes,” Proc. SIGGRAPH '97, pp. 217-224, 1997.
[24] R. Ronfard and J. Rossignac, “Full-Range Approximation of Triangulated Polyhedra,” IEEE Computer Graphics Forum, vol. 15, no. 3, pp. C67-C76, Aug. 1996.
[25] J. Rossignac, “Edgebreaker: Compressing the Incidence Graph of Triangle Meshes,” Technical Report GIT-GVU-98-17, http://www.cc.gatech.edu/gvu/reports/1998, GVU Center, Georgia Inst. of Technology, Atlanta, 1998, IEEE Trans. Visualization and Computer Graphics, to appear.
[26] J. Rossignac, “Through the Cracks of the Solid Modeling Milestone,” From Object Modelling to Advanced Visualization, S. Coquillart, W. Strasser and P. Stucki, eds, pp. 1-75. Springer-Verlag, 1994.
[27] J. Rossignac and P. Borrel, “Multi-Resolution 3D Approximations for Rendering Complex Scenes,” Modeling in Computer Graphics, B. Falcidieno and T.L. Kunii, eds., pp. 455-465. Berlin: Springer-Verlag, 1993.
[28] J. Snoeyink and M. van Kreveld, “Good Orders for Incremental (Re)Construction,” Proc. 13th Symp. Computational Geometry, pp. 400-402, 1997.
[29] M. Soucy and D. Laurendeau, “Multiresolution Surface Modeling Based on Hierarchical Triangulation,” Computer Vision and Image Understanding, vol. 63, pp. 1-14, Jan. 1996.
[30] W.J. Schroeder, J.A. Zarge, and W.E. Lorensen, “Decimation of Triangle Meshes,” Proc. SIGGRAPH '92, pp. 65-70, 1992.
[31] C. Touma and C. Gotsman, “Triangle Mesh Compression,” Proc. Graphics Interface '98, pp. 26-34, 1998.
[32] G. Taubin, A. Guéziec, W. Horn, and F. Lazarus, “Progressive Forest Split Compression,” Proc. SIGGRAPH '98, pp. 123-132, 1998.
[33] G. Taubin, W. Horn, F. Lazarus, and J. Rossignac, “Geometric Coding and VRML,” Proc. IEEE, vol. 86, no. 6, pp. 1,228-1,243, 1998.
[34] P.S. Heckbert and M. Garland, “Survey of Polygonal Surface Simplification Algorithms,” SIGGRAPH 97 Course Notes 25, 1997.
[35] G. Taubin and J. Rossignac, “Geometric Compression through Topological Surgery,” ACM Trans. Graphics, vol. 17, no. 2, pp. 84-115, 1998.
[36] G. Taubin and J. Rossignac, “3D Geometric Compression,” SIGGRAPH 98 Course Notes 21, 1998.
[37] J.C. Xia, J. El-Sana, and A. Varshney, “Adaptive Real-Time Level-of-Detail-Based Rendering for Polygonal Models,” IEEE Trans. Visualization and Computer Graphics, 3, no. 2, pp. 171-183, Apr.-June 1997.
[38] D. Zorin, P. Schröder, and W. Sweldens, “Interpolating Subdivision for Meshes with Arbitrary Topology,” Proc., ACM SIGGRAPH, pp. 189-192, Aug. 1996.

Index Terms:
Triangle mesh compression, geometry compression, progressive meshes, multiresolution modeling.
Citation:
Renato Pajarola, Jarek Rossignac, "Compressed Progressive Meshes," IEEE Transactions on Visualization and Computer Graphics, vol. 6, no. 1, pp. 79-93, Jan.-March 2000, doi:10.1109/2945.841122
Usage of this product signifies your acceptance of the Terms of Use.