Advance in triangular mesh simplification study

With the development of modern 3D acquisition facilities and tools, large mesh models with high-precision for the representation of complex geometric objects becomes feasible. However, many considerable difficulties have emerged in these huge mesh models, such as the storage capacity and rendering speed of computers. Triangular mesh, which is one of the most popular polygonal meshes, plays an important role in mesh simplification field. Many different methods and algorithms have been put forward to the research of triangular mesh simplification in the past few years. In this paper, triangular mesh simplification algorithms and their corresponding improved algorithms are overviewed. In addition, some recent achievements of triangular mesh simplification in the author's laboratory (IAP) are presented. Finally, future development and prospects in this area are also discussed and outlined, respectively.

[1]  Paolo Cignoni,et al.  Multiresolution decimation based on global error , 1996, The Visual Computer.

[2]  Francis Schmitt,et al.  Mesh Simplification , 1996, Comput. Graph. Forum.

[3]  Charles D. Hansen,et al.  Geometric optimization , 1993, Proceedings Visualization '93.

[4]  Rynson W. H. Lau,et al.  Real-time multi-resolution modeling for complex virtual environments , 1996, VRST '96.

[5]  Hugues Hoppe.  Smooth view-dependent level-of-detail control and its application to terrain rendering , 1998, Proceedings Visualization '98 (Cat. No.98CB36276).

[6]  Reinhard Klein,et al.  Mesh reduction with error control , 1996, Proceedings of Seventh Annual IEEE Visualization '96.

[7]  Michael Garland,et al.  A multiphase approach to efficient surface simplification , 2002, IEEE Visualization, 2002. VIS 2002..

[8]  Michael Garland,et al.  Surface simplification using quadric error metrics , 1997, SIGGRAPH.

[9]  Hans-Peter Seidel,et al.  A General Framework for Mesh Decimation , 1998, Graphics Interface.

[10]  Peter Lindstrom,et al.  Fast and memory efficient polygonal simplification , 1998, Proceedings Visualization '98 (Cat. No.98CB36276).

[11]  James H. Clark,et al.  Hierarchical geometric models for visible surface algorithms , 1976, CACM.

[12]  Bernd Hamann,et al.  Smooth hierarchical surface triangulations , 1997, Proceedings. Visualization '97 (Cat. No. 97CB36155).

[13]  Sun-Jeong Kim,et al.  Discrete differential error metric for surface simplification , 2002, 10th Pacific Conference on Computer Graphics and Applications, 2002. Proceedings..

[14]  Paolo Cignoni,et al.  External Memory Management and Simplification of Huge Meshes , 2003, IEEE Trans. Vis. Comput. Graph..

[15]  Peter Lindstrom,et al.  Out-of-core simplification of large polygonal models , 2000, SIGGRAPH.

[16]  Jarek Rossignac,et al.  Multi-resolution 3D approximations for rendering complex scenes , 1993, Modeling in Computer Graphics.

[17]  Peng Wang,et al.  Mesh simplification algorithm based on absolute curvature-weighted quadric error metrics , 2010, 2010 5th IEEE Conference on Industrial Electronics and Applications.

[18]  Christopher DeCoro,et al.  Real-time mesh simplification using the GPU , 2007, SI3D.

[19]  HE Ming-yi.  An Algorithm for Mesh Simplification Based on the Importance of Vertex and Its Application , 2004 .

[20]  James H. Clark.  Hierarchical geometric models for visible-surface algorithms , 1976, SIGGRAPH 1976.

[21]  Tony DeRose,et al.  Mesh optimization , 1993, SIGGRAPH.

[22]  Michael Garland,et al.  Efficient adaptive simplification of massive meshes , 2001, Proceedings Visualization, 2001. VIS '01..

[23]  Volker Luckas,et al.  Managing large progressive meshes , 2004, Comput. Graph..

[24]  Michael Garland,et al.  User-guided simplification , 2003, I3D '03.

[25]  Pierre Alliez,et al.  Valence‐Driven Connectivity Encoding for 3D Meshes , 2001, Comput. Graph. Forum.

[26]  Russell H. Taylor,et al.  Superfaces: polygonal mesh simplification with bounded error , 1996, IEEE Computer Graphics and Applications.

[27]  David P. Luebke,et al.  View-dependent simplification of arbitrary polygonal environments , 1997, SIGGRAPH.

[28]  Denis Laurendeau,et al.  Multiresolution Surface Modeling Based on Hierarchical Triangulation , 1996, Comput. Vis. Image Underst..

[29]  Martin Isenburg,et al.  Out-of-core compression for gigantic polygon meshes , 2003, ACM Trans. Graph..

[30]  William E. Lorensen,et al.  Decimation of triangle meshes , 1992, SIGGRAPH.

[31]  Marc Levoy,et al.  The digital Michelangelo project: 3D scanning of large statues , 2000, SIGGRAPH.

[32]  David Zhang,et al.  Mesh simplification with hierarchical shape analysis and iterative edge contraction , 2004, IEEE Transactions on Visualization and Computer Graphics.

[33]  Tony DeRose,et al.  Multiresolution analysis for surfaces of arbitrary topological type , 1997, TOGS.

[34]  Dinesh Manocha,et al.  Simplification envelopes , 1996, SIGGRAPH.

[35]  Bernd Hamann,et al.  A data reduction scheme for triangulated surfaces , 1994, Comput. Aided Geom. Des..

[36]  Hugues Hoppe,et al.  Progressive meshes , 1996, SIGGRAPH.

[37]  Greg Turk,et al.  Re-tiling polygonal surfaces , 1992, SIGGRAPH.

[38]  Sumanta Guha,et al.  Volume Cost Based Mesh Simplification , 2009, 2009 Sixth International Conference on Computer Graphics, Imaging and Visualization.