Hybrid meshes: multiresolution using regular and irregular refinement

A hybrid mesh is a multiresolution surface representation that combines advantages from regular and irregular meshes. Irregular operations allow a hybrid mesh to change topology throughout the hierarchy and approximate detailed features at multiple scales. A preponderance of regular refinements allows for efficient data-structures and processing algorithms. We provide a user driven procedure for creating a hybrid mesh from scanned geometry and present a progressive hybrid mesh compression algorithm.

[1]  Jihad El-Sana,et al.  Topology Simplification for Polygonal Virtual Environments , 1998, IEEE Trans. Vis. Comput. Graph..

[2]  Carlos Gonzalez-Ochoa,et al.  Localized-hierarchy surface splines (LeSS) , 1999, SI3D.

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

[4]  Craig Gotsman,et al.  Triangle Mesh Compression , 1998, Graphics Interface.

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

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

[7]  Pierre Alliez,et al.  Progressive compression for lossless transmission of triangle meshes , 2001, SIGGRAPH.

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

[9]  Michael S. Floater,et al.  Parametrization and smooth approximation of surface triangulations , 1997, Comput. Aided Geom. Des..

[10]  Tony DeRose,et al.  Piecewise smooth surface reconstruction , 1994, SIGGRAPH.

[11]  Ergun Akleman,et al.  A new paradigm for changing topology during subdivision modeling , 2000, Proceedings the Eighth Pacific Conference on Computer Graphics and Applications.

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

[13]  Hanan Samet,et al.  The Design and Analysis of Spatial Data Structures , 1989 .

[14]  Mark Meyer,et al.  Implicit fairing of irregular meshes using diffusion and curvature flow , 1999, SIGGRAPH.

[15]  Leif Kobbelt,et al.  √3-subdivision , 2000, SIGGRAPH.

[16]  Andrei Khodakovsky,et al.  Progressive geometry compression , 2000, SIGGRAPH.

[17]  D. Zorin,et al.  4-8 Subdivision , 2001 .

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

[19]  Peter Schröder,et al.  Multiresolution signal processing for meshes , 1999, SIGGRAPH.

[20]  Gene H. Golub,et al.  Matrix computations , 1983 .

[21]  Denis Zorin,et al.  A simple algorithm for surface denoising , 2001, Proceedings Visualization, 2001. VIS '01..

[22]  David R. Forsey,et al.  Pasting Spline Surfaces , 1995 .

[23]  Marc Levoy,et al.  Fitting smooth surfaces to dense polygon meshes , 1996, SIGGRAPH.

[24]  Ergun Akleman,et al.  Guaranteeing 2-manifold property for meshes , 1999, Proceedings Shape Modeling International '99. International Conference on Shape Modeling and Applications.

[25]  Hans-Peter Seidel,et al.  Multiresolution Shape Deformations for Meshes with Dynamic Vertex Connectivity , 2000, Comput. Graph. Forum.

[26]  Pierre Alliez,et al.  Valence‐Driven Connectivity Encoding for 3D Meshes , 2001, Comput. Graph. Forum.

[27]  David P. Dobkin,et al.  MAPS: multiresolution adaptive parameterization of surfaces , 1998, SIGGRAPH.

[28]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[29]  Peter Schröder,et al.  Normal meshes , 2000, SIGGRAPH.

[30]  Marc Levoy,et al.  The digital Michelangelo project: 3D scanning of large statues , 2000, SIGGRAPH.

[31]  Zoë J. Wood,et al.  Topological Noise Removal , 2001, Graphics Interface.