Multiresolution Modeling: Survey & Future Opportunities

For twenty years, it has been clear that many datasets are excessively complex for applications such as real-time display, and that techniques for controlling the level of detail of models are crucial. More r ecently, there has been considerable interest in techniques for the automatic simplification of highly detailed polygonal models into faithful approximations using fewer polygons. Several effective techniques for the automatic simplification of polygonal models have been developed in recent years. This report begins with a survey of the most notable available algorithms. Iterative edge contraction algorithms are of particular interest because they induce a certain hierarchical structure on the surface. An overview of this hierarchical structure is presented,including a formulation relating it to minimum spanning tree construction algorithms. Finally, we will consider the most significant directions in which existing simplification methods can be improved, and a summary of other potential applications for the hierarchies resulting from simplification.

[1]  David H. Douglas,et al.  ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE , 1973 .

[2]  P. M. Prenter.  Splines and variational methods , 1975 .

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

[4]  Robert E. Tarjan,et al.  Finding Minimum Spanning Trees , 1976, SIAM J. Comput..

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

[6]  Michael Henle,et al.  A combinatorial introduction to topology , 1978 .

[7]  James J. Little,et al.  Automatic extraction of Irregular Network digital terrain models , 1979, SIGGRAPH.

[8]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[9]  Olivier D. Faugeras,et al.  Polyhedral approximation of 3-D objects without holes , 1984, Comput. Vis. Graph. Image Process..

[10]  L. Guibas,et al.  Primitives for the manipulation of general subdivisions and the computation of Voronoi , 1985, TOGS.

[11]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[12]  Francis J. M. Schmitt,et al.  An adaptive subdivision method for surface-fitting from sampled data , 1986, SIGGRAPH.

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

[14]  Jia-Guu Leu,et al.  Polygonal approximation of 2-D shapes through boundary merging , 1988, Pattern Recognit. Lett..

[15]  M. Iri,et al.  Polygonal Approximations of a Curve — Formulations and Algorithms , 1988 .

[16]  Stéphane Mallat,et al.  A Theory for Multiresolution Signal Decomposition: The Wavelet Representation , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[17]  Steve D. Upstill,et al.  The renderman companion - a programmer's guide to realistic computer graphics , 1990 .

[18]  B. Naylor,et al.  Piecewise linear approximations of digitized space curves with applications , 1991 .

[19]  Michael Zyda,et al.  Simplification of objects rendered by polygonal approximations , 1991, Comput. Graph..

[20]  Shmuel Rippa,et al.  Adaptive Approximation by Piecewise Linear Polynomials on Triangulations of Subsets of Scattered Data , 1992, SIAM J. Sci. Comput..

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

[22]  Gary L. Miller,et al.  Automatic Mesh Partitioning , 1992 .

[23]  Carlo H. Séquin,et al.  Management of large amounts of data in interactive building walkthroughs , 1992, I3D '92.

[24]  Carlo H. Séquin,et al.  Database and display algorithms for interactive visualization of architectural models , 1993 .

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

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

[27]  Lori L. Scarlatos.  Spatial data representations for rapid visualization and analysis , 1993 .

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

[29]  Laurence Boxer,et al.  Polygonal approximation by boundary reduction , 1993, Pattern Recognit. Lett..

[30]  Josie Wernecke,et al.  The inventor mentor - programming object-oriented 3D graphics with Open Inventor, release 2 , 1993 .

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

[32]  Subhash Suri,et al.  Surface approximation and geometric partitions , 1994, SODA '94.

[33]  John Rohlf,et al.  IRIS performer: a high performance multiprocessing toolkit for real-time 3D graphics , 1994, SIGGRAPH.

[34]  Hervé Delingette,et al.  Simplex meshes: a general representation for 3D shape reconstruction , 1994, 1994 Proceedings of IEEE Conference on Computer Vision and Pattern Recognition.

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

[36]  W. Stürzlinger,et al.  Generating Multiple Levels of Detail from Polygonal Geometry Models , 1995, Virtual Environments.

[37]  Philip N. Klein,et al.  A randomized linear-time algorithm to find minimum spanning trees , 1995, JACM.

[38]  Alexis Gourdon.  Simplification of Irregular Surface Meshes in 3D Medical Images , 1995, CVRMed.

[39]  Makoto Maruya.  Generating a Texture Map from Object‐Surface Texture Data , 1995, Comput. Graph. Forum.

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

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

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

[43]  William Ribarsky,et al.  Real-time, continuous level of detail rendering of height fields , 1996, SIGGRAPH.

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

[45]  David Salesin,et al.  Wavelets for computer graphics - theory and applications , 1996, The Morgan Kaufmann series in computer graphics and geometric modeling.

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

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

[48]  David Salesin,et al.  Interactive multiresolution surface viewing , 1996, SIGGRAPH.

[49]  Marc Rioux,et al.  A texture-mapping approach for the compression of colored 3D triangulations , 1996, The Visual Computer.

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

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

[52]  Amitabh Varshney,et al.  Controlled Topology Simplification , 1996, IEEE Trans. Vis. Comput. Graph..

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

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

[55]  W. Schroeder.  A topology modifying progressive decimation algorithm , 1997, Proceedings. Visualization '97 (Cat. No. 97CB36155).

[56]  Jihad El-Sana,et al.  Controlled simplification of genus for polygonal models , 1997, Proceedings. Visualization '97 (Cat. No. 97CB36155).

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

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

[59]  Leila De Floriani,et al.  A Formal Approach to Multiresolution Hypersurface Modeling , 1997, Geometric Modeling.

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

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

[62]  Jovan Popovic,et al.  Progressive simplicial complexes , 1997, SIGGRAPH.

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

[64]  Pavan K. Desikan,et al.  An efficient algorithm for terrain simplification , 1997, SODA '97.

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

[66]  David E. Sigeti,et al.  ROAMing terrain: Real-time Optimally Adapting Meshes , 1997, Proceedings. Visualization '97 (Cat. No. 97CB36155).

[67]  Bernd Hamann,et al.  Simplification of tetrahedral meshes , 1998, Proceedings Visualization '98 (Cat. No.98CB36276).

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

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

[70]  Dinesh Manocha,et al.  A unified approach for simplifying polygonal and spline models , 1998, Proceedings Visualization '98 (Cat. No.98CB36276).

[71]  L. Floriani,et al.  Efficient implementation of multi-triangulations , 1998, Proceedings Visualization '98 (Cat. No.98CB36276).

[72]  Paolo Cignoni,et al.  A general method for preserving attribute values on simplified meshes , 1998 .

[73]  Carlo Tomasi,et al.  Texture metrics , 1998, SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218).

[74]  M. Garland,et al.  Fast Polygonal Approximation of Terrains and Height Fields , 1998 .

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

[76]  Rynson W. H. Lau,et al.  Real-Time Continuous Multiresolution Method for Models of Arbitrary Topology , 1998, Presence.

[77]  Issac J. Trotts,et al.  Simplification of tetrahedral meshes , 1998 .

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

[79]  Hugues Hoppe,et al.  Efficient implementation of progressive meshes , 1998, Comput. Graph..

[80]  Simplifying surfaces with color and texture using quadric error metrics , 1998, VIS '98.

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

[82]  Gabriel Taubin,et al.  Converting sets of polygons to manifold surfaces by cutting and stitching , 1998, Proceedings Visualization '98 (Cat. No.98CB36276).

[83]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[84]  Markus H. Gross,et al.  Progressive tetrahedralizations , 1998, Proceedings Visualization '98 (Cat. No.98CB36276).

[85]  Bernd Hamann,et al.  Constructing Hierarchies for Triangle Meshes , 1998, IEEE Trans. Vis. Comput. Graph..

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

[87]  Greg Turk,et al.  Fast and memory efficient polygonal simplification , 1998, Proceedings Visualization '98 (Cat. No.98CB36276).

[88]  Michael Garland,et al.  Multiresolution Modeling for Fast Rendering , 1999 .

[89]  M. Garland,et al.  Quadric-Based Polygonal Surface Simplification , 1999 .

[90]  Dinesh Manocha,et al.  GAPS: general and automatic polygonal simplification , 1999, SI3D.

[91]  Michael Garland,et al.  Face Cluster Radiosity , 1999, Rendering Techniques.