Truly selective polygonal mesh hierarchies with error control

In this work a new multi-resolution model is proposed for polygonal meshes. It is based on the dual edge collapse, which performs face clustering instead of vertex clustering. The new hierarchical mesh representation combines a truly selective refinement scheme with a strict control of the two-sided Hausdorff distance. The proposed approach allows to build hierarchical meshes directly over non-triangulated polygonal models. As most dependencies in the hierarchy are in the form of trees, the resulting representation is very compact and allows for a compressed in-core representation. Furthermore an optimization scheme is proposed for the hierarchy based on variational shape approximation.

[1]  Seungyong Lee,et al.  View-dependent streaming of progressive meshes , 2004, Proceedings Shape Modeling Applications, 2004..

[2]  Bruce G. Baumgart.  A polyhedron representation for computer vision , 1975, AFIPS '75.

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

[4]  Renato Pajarola,et al.  FastMesh: efficient view-dependent meshing , 2001, Proceedings Ninth Pacific Conference on Computer Graphics and Applications. Pacific Graphics 2001.

[5]  Reinhard Klein,et al.  Data Compression of Multiresolution Surfaces , 1998 .

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

[7]  Mathieu Desbrun,et al.  Variational shape approximation , 2004, SIGGRAPH 2004.

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

[9]  Seungyong Lee,et al.  Truly Selective Refinement of Progressive Meshes , 2001, Graphics Interface.

[10]  Reinhard Klein,et al.  Geometric Modeling: Theory and Practice , 1997, Focus on Computer Graphics.

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

[12]  Christopher DeCoro,et al.  XFastMesh: fast view-dependent meshing from external memory , 2002, IEEE Visualization, 2002. VIS 2002..

[13]  Lutz Kettner,et al.  Designing a data structure for polyhedral surfaces , 1998, SCG '98.

[14]  S. Gumhold.  Progressive Polygonal Meshes , 2004 .

[15]  J. Ian Munro,et al.  Succinct Representation of Balanced Parentheses and Static Trees , 2002, SIAM J. Comput..

[16]  Lutz Kettner,et al.  Using generic programming for designing a data structure for polyhedral surfaces , 1999, Comput. Geom..

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

[18]  Leif Kobbelt,et al.  OpenMesh: A Generic and Efficient Polygon Mesh Data Structure , 2002 .

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

[20]  Kevin Weiler,et al.  Edge-Based Data Structures for Solid Modeling in Curved-Surface Environments , 1985, IEEE Computer Graphics and Applications.