User-assisted simplification method for triangle meshes preserving boundaries

This paper proposes a user-assisted mesh simplification method applied to CAD models converted to triangle meshes. This work offers the possibility of simplifying each subobject independently and at different levels of detail. This way, the user can simplify the whole model and then modify some parts, by simplifying more or by refining the desired subobjects. This can be performed while the total number of triangles in the simplified model is maintained. In this method any error metric based on an edge collapse operation can be used. Boundaries between subobjects are preserved and important attributes in the final aspect of simplified models, like normals and texture coordinates, are also considered.

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

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

[3]  Dinesh Manocha,et al.  Homotopy-preserving medial axis simplification , 2005, SPM '05.

[4]  David P. Luebke,et al.  Perceptually-Driven Simplification for Interactive Rendering , 2001, Rendering Techniques.

[5]  Greg Turk,et al.  Image-driven simplification , 2000, TOGS.

[6]  Mateu Sbert,et al.  Viewpoint Entropy-Driven Simplification , 2007 .

[7]  Fabien Vivodtzev,et al.  Topology-preserving simplification of 2D nonmanifold meshes with embedded structures , 2005, The Visual Computer.

[8]  Kunwoo Lee,et al.  Geometric detail suppression by the Fourier transform , 1998, Comput. Aided Des..

[9]  Jonathan D. Cohen,et al.  Perceptually guided simplification of lit, textured meshes , 2003, I3D '03.

[10]  Eugene Zhang,et al.  Visibility-guided simplification , 2002, IEEE Visualization, 2002. VIS 2002..

[11]  Michael Garland,et al.  Simplifying surfaces with color and texture using quadric error metrics , 1998, Proceedings Visualization '98 (Cat. No.98CB36276).

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

[13]  Greg Turk,et al.  Simplification and Repair of Polygonal Models Using Volumetric Techniques , 2003, IEEE Trans. Vis. Comput. Graph..

[14]  Satyandra K. Gupta,et al.  A survey of CAD model simplification techniques for physics-based simulation applications , 2009, Comput. Aided Des..

[15]  Sang Hun Lee.  Feature-based multiresolution modeling of solids , 2005, TOGS.

[16]  Mateu Sbert,et al.  Importance-Driven Focus of Attention , 2006, IEEE Transactions on Visualization and Computer Graphics.

[17]  Mateu Sbert,et al.  A unified information-theoretic framework for viewpoint selection and mesh saliency , 2009, TAP.

[18]  Jung-Hong Chuang,et al.  Texture Adaptation for Progressive Meshes , 2006, Comput. Graph. Forum.

[19]  Hugues Hoppe,et al.  New quadric metric for simplifying meshes with appearance attributes , 1999, Proceedings Visualization '99 (Cat. No.99CB37067).

[20]  Paul S. Heckbert,et al.  Survey of Polygonal Surface Simplification Algorithms , 1997 .

[21]  William J. Schroeder.  A topology modifying progressive decimation algorithm , 1997 .

[22]  Mateu Sbert,et al.  Viewpoint-driven simplification using mutual information , 2008, Comput. Graph..

[23]  Hugues Hoppe,et al.  View-dependent refinement of progressive meshes , 1997, SIGGRAPH.

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

[25]  Enrico Puppo,et al.  Simplification, LOD and MultiresolutionPrinciples and Applications , 1997, Eurographics.

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

[27]  David W. Jacobs,et al.  Mesh saliency , 2005, SIGGRAPH 2005.

[28]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[29]  Shouqian Sun,et al.  Texture Information Driven Triangle Mesh Simplification , 2005, Computer Graphics and Imaging.

[30]  Michael Garland,et al.  Multiresolution Modeling: Survey and Future Opportunities , 1999, Eurographics.

[31]  Dinesh Manocha,et al.  Appearance-preserving simplification , 1998, SIGGRAPH.

[32]  Alan C. Lin,et al.  Automatic generation of NC cutter path from massive data points , 1998, Comput. Aided Des..

[33]  David R. White,et al.  Meshing Complexity of Single Part CAD Models , 2003, IMR.

[34]  Yuan Zhou,et al.  Quadric-based simplification in any dimension , 2005, TOGS.

[35]  Kok-Lim Low,et al.  Model simplification using vertex-clustering , 1997, SI3D.

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

[37]  David P. Luebke,et al.  A Developer's Survey of Polygonal Simplification Algorithms , 2001, IEEE Computer Graphics and Applications.

[38]  William E. Lorensen,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.

[39]  Shi-Min Hu,et al.  An effective feature-preserving mesh simplification scheme based on face constriction , 2001, Proceedings Ninth Pacific Conference on Computer Graphics and Applications. Pacific Graphics 2001.

[40]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .