Efficient and Feature-Preserving Triangular Mesh Decimation

Most of the existing algorithms for decimation of triangular meshes perform poorly at very low levels of detail. We propose a new automatic method for the decimation of triangular meshes, which performs better as compared to the notable existing algorithms at low levels of detail, preserves visually important parts of the mesh and thus keeps the semantic or high level meaning of the model. The proposed algorithm is based on greedy approach and exploites a new method of measuring geometric error employing a form of vertex visual importance that helps to keep visually impotant vertices even at low levels of detail and causes to remove other kinds of vertices, which do not profoundly influence the overall shape of the model. In addition, the proposed method has less momory overhead as compared to most of the published algorithms and is faster in terms of running times. The results of the algorithm have been compared numerically, visually, in terms of execution times and memory consumption with the sate-of-the-art decimation methods to strengthen the efficiency and quality of the algorithm.

[1]  Benjamin Watson,et al.  Model Simplification Through Refinement , 2000, Graphics Interface.

[2]  Greg Turk,et al.  Fast and memory efficient polygonal simplification , 1998 .

[3]  Chandrajit L. Bajaj,et al.  Error-bounded reduction of triangle meshes with multivariate data , 1996, Electronic Imaging.

[4]  David Luebke,et al.  A Survey of Polygonal Simplification Algorithms , 1997 .

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

[6]  Rémi Ronfard,et al.  Full‐range approximation of triangulated polyhedra. , 1996, Comput. Graph. Forum.

[7]  Paolo Cignoni,et al.  Metro: Measuring Error on Simplified Surfaces , 1998, Comput. Graph. Forum.

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

[9]  David Levin,et al.  Surface simplification using a discrete curvature norm , 2002, Comput. Graph..

[10]  Paolo Cignoni,et al.  A comparison of mesh simplification algorithms , 1998, Comput. Graph..

[11]  Muhammad Hussain,et al.  Fast, Simple, Feature Preserving and Memory Efficient Simplification of Triangle Meshes , 2003, Int. J. Image Graph..

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

[13]  Muhammad Hussain,et al.  LOD modelling of polygonal models based on multiple choice optimisation , 2004, 10th International Multimedia Modelling Conference, 2004. Proceedings..

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

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

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