Computing geometry-aware handle and tunnel loops in 3D models

Many applications such as topology repair, model editing, surface parameterization, and feature recognition benefit from computing loops on surfaces that wrap around their 'handles' and 'tunnels'. Computing such loops while optimizing their geometric lengths is difficult. On the other hand, computing such loops without considering geometry is easy but may not be very useful. In this paper we strike a balance by computing topologically correct loops that are also geometrically relevant. Our algorithm is a novel application of the concepts from topological persistence introduced recently in computational topology. The usability of the computed loops is demonstrated with some examples in feature identification and topology simplification.

[1]  Daniela Giorgi,et al.  Reeb graphs for shape analysis and applications , 2008, Theor. Comput. Sci..

[2]  Tamal K. Dey,et al.  Curve and Surface Reconstruction , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[3]  Xianfeng Gu,et al.  Computing Shortest Cycles Using Universal Covering Space , 2007, CAD/Graphics.

[4]  Jeff Erickson,et al.  Tightening non-simple paths and cycles on surfaces , 2006, SODA 2006.

[5]  Steven J. Gortler,et al.  Geometry images , 2002, SIGGRAPH.

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

[7]  Valerio Pascucci,et al.  Robust on-line computation of Reeb graphs: simplicity and speed , 2007, SIGGRAPH 2007.

[8]  Craig Gotsman,et al.  Conformal Flattening by Curvature Prescription and Metric Scaling , 2008, Comput. Graph. Forum.

[9]  John C. Hart,et al.  Seamster: inconspicuous low-distortion texture seam layout , 2002, IEEE Visualization, 2002. VIS 2002..

[10]  David Cohen-Steiner,et al.  Vines and vineyards by updating persistence in linear time , 2006, SCG '06.

[11]  Shi-Min Hu,et al.  Topology Repair of Solid Models Using Skeletons , 2007, IEEE Transactions on Visualization and Computer Graphics.

[12]  Herbert Edelsbrunner,et al.  Topological Persistence and Simplification , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[13]  Greg Turk,et al.  Simplification and Repair of Polygonal Models Using Volumetric Techniques , 2003, IEEE Trans. Vis. Comput. Graph..

[14]  Joshua A. Levine,et al.  A Practical Delaunay Meshing Algorithm for aLarge Class of Domains* , 2007, IMR.

[15]  Gauthier Lafruit,et al.  Adaptive 3D Content for Multi-Platform On-Line Games , 2007, CW 2007.

[16]  Jihad El-Sana,et al.  Controlled simplification of genus for polygonal models , 1997 .

[17]  Francis Lazarus,et al.  Optimal System of Loops on an Orientable Surface , 2005, Discret. Comput. Geom..

[18]  Chao Chen,et al.  Quantifying Homology Classes , 2008, STACS.

[19]  Afra Zomorodian,et al.  Computing Persistent Homology , 2005, Discret. Comput. Geom..

[20]  Jeff Erickson,et al.  Greedy optimal homotopy and homology generators , 2005, SODA '05.

[21]  Leif Kobbelt,et al.  Structure Preserving CAD Model Repair , 2005, Comput. Graph. Forum.

[22]  Richard M. Leahy,et al.  Automated graph-based analysis and correction of cortical volume topology , 2001, IEEE Transactions on Medical Imaging.

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

[24]  R. Ho.  Algebraic Topology , 2022 .

[25]  Kodama,et al.  Mass Density Laplace-Spectra for Image Recognition , 2007, CW 2007.

[26]  M. Yvinec,et al.  Meshing Volumes Bounded by Smooth Surfaces , 2005, IMR.

[27]  M. Yvinec,et al.  Variational tetrahedral meshing , 2005, SIGGRAPH 2005.

[28]  Mathieu Desbrun,et al.  Removing excess topology from isosurfaces , 2004, TOGS.

[29]  Afra Zomorodian,et al.  Localized Homology , 2007, Shape Modeling International.

[30]  Tamal K. Dey,et al.  Defining and computing curve-skeletons with medial geodesic function , 2006, SGP '06.

[31]  J. Hart,et al.  Fair morse functions for extracting the topological structure of a surface mesh , 2004, SIGGRAPH 2004.

[32]  PascucciValerio,et al.  Robust on-line computation of Reeb graphs , 2007 .