Re-meshing techniques for topological analysis

A method for the extraction of the extended Reeb graph (ERG) from a closed 3D triangular mesh is presented. The ERG encodes the relationships among critical points of the height function associated to the mesh, and it can represent isolated as well as degenerate critical points. The extraction process is based on a re-meshing strategy of the original mesh, which is forced to follow contour levels. The occurrence and configuration of flat areas in the re-triangulated model identify critical areas of the shape, and their relationships allow the reconstruction of the global topological structure of the shape.

[1]  Jesse Freeman,et al.  in Morse theory, , 1999 .

[2]  Herbert Edelsbrunner,et al.  Auditory Morse Analysis of Triangulated Manifolds , 1997, VisMath.

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

[4]  Sabine Coquillart,et al.  3D Reconstruction of Complex Polyhedral Shapes from Contours using a Simplified Generalized Voronoi Diagram , 1996, Comput. Graph. Forum.

[5]  David E. Breen,et al.  Semi-regular mesh extraction from volumes , 2000 .

[6]  John C. Hart,et al.  Computational topology for shape modeling , 1999, Proceedings Shape Modeling International '99. International Conference on Shape Modeling and Applications.

[7]  Chandrajit L. Bajaj,et al.  Topology preserving data simplification with error bounds , 1998, Comput. Graph..

[8]  Tosiyasu L. Kunii,et al.  Constructing a Reeb graph automatically from cross sections , 1991, IEEE Computer Graphics and Applications.

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

[10]  Silvia Biasotti,et al.  Extended Reeb Graphs for Surface Understanding and Description , 2000, DGCI.

[11]  Han-Wei Shen,et al.  A Near Optimal Isosurface Extraction Algorithm Using the Span Space , 1996, IEEE Trans. Vis. Comput. Graph..

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

[13]  Adam Ostaszewski,et al.  Topology : a geometric approach , 1992 .

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

[15]  T. Banchoff.  Critical Points and Curvature for Embedded Polyhedral Surfaces , 1970 .

[16]  Marc J. van Kreveld,et al.  On Quality Paths on Polyhedral Terrains , 1994, IGIS.

[17]  Alex Pentland,et al.  Perceptual Organization and the Representation of Natural Form , 1986, Artif. Intell..

[18]  R. Pollack,et al.  Advances in Discrete and Computational Geometry , 1999 .

[19]  Valerio Pascucci,et al.  Fast isocontouring for improved interactivity , 1996, VVS '96.

[20]  R. Lee,et al.  Two-Dimensional Critical Point Configuration Graphs , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[21]  Tosiyasu L. Kunii,et al.  Surface coding based on Morse theory , 1991, IEEE Computer Graphics and Applications.

[22]  Alexander Russell,et al.  Computational topology: ambient isotopic approximation of 2-manifolds , 2003, Theor. Comput. Sci..

[23]  Silvia Biasotti,et al.  Shape Abstraction Using Computational Topology Techniques , 2002, Workshop on Geometric Modeling.

[24]  David Meyers.  Reconstruction of surfaces from planar contours , 1995 .

[25]  David Eppstein,et al.  On triangulating three-dimensional polygons , 1998, Comput. Geom..

[26]  Heinrich Ebner,et al.  Automatic derivation of skeleton lines from digitized contours , 1991 .

[27]  Henry Fuchs,et al.  Optimal surface reconstruction from planar contours , 1977, CACM.