Simplifying polygonal models using successive mappings

We present the use of mapping functions to automatically generate levels of detail with known error bounds for polygonal models. We develop a piece-wise linear mapping function for each simplification operation and use this function to measure deviation of the new surface from both the previous level of detail and from the original surface. In addition, we use the mapping function to compute appropriate texture coordinates if the original map has texture coordinates at its vertices. Our overall algorithm uses edge collapse operations. We present rigorous procedures for the generation of local planar projections as well as for the selection of a new vertex position for the edge collapse operation. As compared to earlier methods, our algorithm is able to compute tight error bounds on surface deviation and produce an entire continuum of levels of detail with mappings between them. We demonstrate the effectiveness of our algorithm on several models: a Ford Bronco consisting of over 300 parts and 70,000 triangles, a textured lion model consisting of 49 parts and 86,000 triangles, and a textured, wrinkled torus consisting of 79,000 triangles.

[1]  Manfredo P. do Carmo,et al.  Differential geometry of curves and surfaces , 1976 .

[2]  Robert E. Beck,et al.  Elementary Linear Programming with Applications , 1979 .

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

[4]  Jihad El-Sana,et al.  Adaptive Real-Time Level-of-Detail-Based Rendering for Polygonal Models , 1997, IEEE Trans. Vis. Comput. Graph..

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

[6]  Jarek Rossignac,et al.  BRUSH as a Walkthrough System for Architectural Models , 1995 .

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

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

[9]  Raimund Seidel,et al.  Linear programming and convex hulls made easy , 1990, SCG '90.

[10]  Amitabh Varshney,et al.  Hierarchical geometric approximations , 1994 .

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

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

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

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

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

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

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

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

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

[20]  Chuck Hansen,et al.  Eurographics '97 , 1998, COMG.

[21]  Chandrajit L. Bajaj,et al.  Decimation of 2D Scalar Data with Error Control , 1995 .