User-controlled simplification of polygonal models

Polygonal models are ubiquitous in computer graphics but their real time manipulation and rendering especially in interactive application environments have become a threat because of their huge sizes and complexity. A whole family of automatic algorithms emerged during the last decade to help out this problem, but they reduce the complexity of the models uniformly without caring about semantic importance of localized parts of a mesh. Only a few algorithms deal with adaptive simplification of polygonal models. We propose a new model for user-driven simplification exploiting the simplification hierarchy and hypertriangulation model [P. Cignoni et al.] that lends a user the most of the functionalities of existing adaptive simplification algorithms in one place and is quite simple to implement. The proposed new underlying data structures are compact and support real time navigation across continuous LODs of a model; any desirable LOD can be extracted efficiently and can further be fine-tuned. The proposed model for adaptive simplification supports two key operations for selective refinement and selective simplification; their effect has been shown on various polygonal models. Comparison with related work shows that the proposed model provides combined environment at reduced overhead of memory space usage and faster running times.

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

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

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

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

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

[6]  Dieter Schmalstieg,et al.  User-controlled creation of multiresolution meshes , 2003, I3D '03.

[7]  Peter Lindstrom,et al.  Evaluation of Memoryless Simplification , 1999, IEEE Trans. Vis. Comput. Graph..

[8]  Muhammad Hussain,et al.  Efficient and Feature-Preserving Triangular Mesh Decimation , 2004, WSCG.

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

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

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

[12]  André Guéziec,et al.  Locally Toleranced Surface Simplification , 1999, IEEE Trans. Vis. Comput. Graph..

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

[14]  Paolo Cignoni,et al.  Zeta: A Resolution Modeling System , 1998, Graph. Model. Image Process..

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

[16]  Carlo H. Séquin,et al.  Adaptive display algorithm for interactive frame rates during visualization of complex virtual environments , 1993, SIGGRAPH.

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

[18]  Amitabh Varshney,et al.  Dynamic view-dependent simplification for polygonal models , 1996, Proceedings of Seventh Annual IEEE Visualization '96.

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

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

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

[22]  Benjamin Watson,et al.  Semiautomatic simplification , 2001, I3D '01.