Multiresolution decimation based on global error

Due to the surface meshes produced at increasing complexity in many applications, interest in efficient simplification algorithms and multiresolution representation is very high. An enhanced simplification approach together with a general multiresolution data scheme are presented here. Jade, a new simplification solution based on the Mesh Decimation approach has been designed to provide both increased approximation precision, based on global error management, and multiresolution output. Moreover, we show that with a small increase in memory, which is needed to store the multiresolution data representation, we are able to extract any level of detail representation from the simplification results in an extremely efficient way. Results are reported on empirical time complexity, approximation quality, and simplification power. TEL:: +39 050 593304

[1]  Paul Haeberli,et al.  Paint by numbers: abstract image representations , 1990, SIGGRAPH.

[2]  Marilyn E. Noz,et al.  Constructing topologically connected surfaces for the comprehensive analysis of 3-D medical structures , 1991, Medical Imaging.

[3]  Joe Warren,et al.  Compact Isocontours from sampled Data , 1992, Graphics Gems III.

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

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

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

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

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

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

[10]  Jane Wilhelms,et al.  Multi-dimensional trees for controlled volume rendering and compression , 1994, VVS '94.

[11]  Paolo Cignoni,et al.  Multiresolution Modeling and Rendering of Volume Data based on Simplicial Complexes , 1994 .

[12]  Marc Levoy,et al.  Zippered polygon meshes from range images , 1994, SIGGRAPH.

[13]  Joseph O'Rourke,et al.  Computational Geometry in C. , 1995 .

[14]  Tony DeRose,et al.  Multiresolution analysis of arbitrary meshes , 1995, SIGGRAPH.

[15]  Leila De Floriani,et al.  Hierarchical triangulation for multiresolution surface description , 1995, TOGS.

[16]  Michael Deering,et al.  Geometry compression , 1995, SIGGRAPH.

[17]  Marc Levoy,et al.  A volumetric method for building complex models from range images , 1996, SIGGRAPH.

[18]  A. Guéziec.  Surface simplification inside a tolerance volume , 1996 .

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

[20]  Roberto Scopigno,et al.  DiscMC: an interactive system for fast fitting isosurfaces on volume data , 1996 .

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

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

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

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

[25]  Paolo Cignoni,et al.  Optimal isosurface extraction from irregular volume data , 1996, Proceedings of 1996 Symposium on Volume Visualization.

[26]  Paolo Cignoni,et al.  Representation and visualization of terrain surfaces at variable resolution , 1997, The Visual Computer.

[27]  William Schroeder,et al.  The Visualization Toolkit: An Object-Oriented Approach to 3-D Graphics , 1997 .

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