Triangle mesh compression and simplification

• Autorzy: Wu X. , Li D.
• Języki publikacji: EN

Abstrakty

EN

Triangular meshes are widely used in computer graphics fields, such as GIS, CAD and VR. Very complex models, with hundreds of thousands of faces, are easily produced by curremt CAD tools, automatic acquisition devices, or by fitting isosurfaces out of volume datasets. Many geometric datasets require a larg amount of disk space. One of the solutions is to compress those large geometric data sets with geometric compression algorithms. On the other hand, a highly complex data representation is not always necessery. For example, a full size model is not required for generation of each frame of an interactive visualization. This has led to substantial research on the surface mesh compression or mesh simplification. We present a method to deal with both issues. It breaks down the triangle meshes into a set of triangle strips and vertex chains. Following that, inter-triangle-strip simplification and intra-triangle-strip simplification are used to simplify the meshes. The method can not only compress the mesh geometry datasets for hard disk storage, but also simplify the meshes for the purposes of rendering and displaying. The results show the validity and efficiency of our method.

Słowa kluczowe

EN

triangular meshes; mesh compression; mesh simplification; triangle strip

• Wydawca: Institute of Information Technology of the Warsaw University of Life Sciences – SGGW
• Czasopismo: Machine Graphics and Vision
• Rocznik: 2002
• Tom: Vol. 11, No. 4
• Strony: 475--488
• Opis fizyczny: Bibliogr. 18 poz.

Twórcy

autor

Wu X.

• Image Processing & Intelligent Control Key Laboratory of China, Institute of Pattern Recognition & Artificial Intelligence, Huazhong University of Science & Technology, Wuhan 430074, P.R.China

autor

Li D.

• Image Processing & Intelligent Control Key Laboratory of China, Institute of Pattern Recognition & Artificial Intelligence, Huazhong University of Science & Technology, Wuhan 430074, P.R.China,

Bibliografia

• [1] Clark J. H.: Hierarchical geometric models for visible surface algorithms. Comm. ACM, 19, 547-554. 1976.
• [2] Kalvin A. D., Cutting C. B., Haddad B., Noz M. E.: Constructing topologically connected surfaces for the comprehensive analysis of 3D medical structures. SPIE, 1445, 247-259. 1991.
• [3] Schroeder W. J., Zarge J. A., Lorensen W. E.: Decimation of triangle meshes. SIGGRAPH'92, 26, 65-70. 1992.
• [4] Rossignac J., Barrel P.: Multi-resolution 3D approximation for rendering complex scenes. Geometric Modeling in Computer Graphics, 455-465. 1993.
• [5] Deering M.: Geometry compression. SIGGRAPH'95, 29, 13-20. 1995.
• [6] Hebert D. J., Kim H.-J.: Image encoding with triangulation wavelets. SPIE 2569(1), 381-392. 1995.
• [7] Bajaj C., Schikore D.: error-bounded reduction of triangle meshes with multivariate data'. SPIE, 2656, 34-45. 1996.
• [8] Certain A., Popovic J., DeRose T., Duchamp T., Salesin D., Stuetzle W.: Interactive multiresolution surface viewing. SIGGRAPH'96, 30. 1996.
• [9] Hopper H.: Progressive meshes. SIGGRAPH'96, 30, 99-108. 1996.
• [10] Kalvin D., Taylor R. H.: Superfaces: poligonal mesh simplification with bounded error. IEEE G.&A., 16(3), 64-77. 1996.
• [11] Reddy M.: SCROOGE: Perceptually-driven polygon reduction. Computer Graphics Forum, 15(4), 191-203. 1996.
• [12] Taubin G., Rossignac J.: Geometric compression through topological surgery. TR, RR RC-20340, IBM Research Division. 1996.
• [13] Chow M.: Optimized geometry compression for real time rendering. IEEE, Proc. Visualization'97, 347-354. 1997.
• [14] Cignoni P., Montani C. , Scopigno R.: A comparison of mesh simplification algorithms. TR,97-08 , Istituto CNUCE - C.N.R., Pisa, Italy, June. 1997
• [15] Garland M., Heckbert P. S.: Surface simplification using quadric error metrics. SIGGRAPH'97, 31, 209-216. 1997.
• [16] Touma C., Gotsman C.: Triangle mesh compression. Proc. Graphics Interface'98, 26-34, 199. 1998.
• [17] Levoy M.: The Digital Michel angelo Projects. 3D Photography Course Notes, SIGGRAPH. 2000.
• [18] Hopper H., Sander P. V.: Texture-mapping progressive meshes. SIGGRAPH'0l, 35, 409-416. 2001.