Computing handle and tunnel loops with knot linking

Many applications seek to identify features like 'handles' and 'tunnels' in a shape bordered by a surface, embedded in three dimensions. To this end, we define handle and tunnel loops on surfaces which can help identify these features. We show that a closed surface of genus g always has g handle and g tunnel loops induced by the embedding. For a class of shapes that retract to graphs, we characterize these loops by a linking condition with these graphs. These characterizations lead to algorithms for detection and generation of these loops. We provide an implementation with applications to feature detection and topology simplification to show the effectiveness of the method.

[1]  D. Rolfsen.  Knots and Links , 2003 .

[2]  F. Chazal,et al.  Stability and homotopy of a subset of the medial axis , 2004, SM '04.

[3]  Tamal K. Dey,et al.  Approximating the Medial Axis from the Voronoi Diagram with a Convergence Guarantee , 2003, Algorithmica.

[4]  David Cohen-Steiner,et al.  Computing geometry-aware handle and tunnel loops in 3D models , 2008, ACM Trans. Graph..

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

[6]  Tamal K. Dey,et al.  A new technique to compute polygonal schema for 2-manifolds with application to null-homotopy detection , 1995, Discret. Comput. Geom..

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

[8]  Jeff Erickson,et al.  Optimally Cutting a Surface into a Disk , 2002, SCG '02.

[9]  Xianfeng Gu,et al.  Computing shortest cycles using universal covering space , 2007, 2007 10th IEEE International Conference on Computer-Aided Design and Computer Graphics.

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

[11]  James R. Munkres,et al.  Elements of algebraic topology , 1984 .

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

[13]  Edgar A. Ramos,et al.  Medial axis approximation and unstable flow complex , 2006, SCG '06.

[14]  Jihad El-Sana,et al.  Controlled simplification of genus for polygonal models , 1997, Proceedings. Visualization '97 (Cat. No. 97CB36155).

[15]  Chee-Keng Yap,et al.  Computational complexity of combinatorial surfaces , 1990, SCG '90.

[16]  R. Fenn.  GEOMETRIC TOPOLOGY IN DIMENSIONS 2 AND 3 , 1978 .

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

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

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

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

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

[22]  Herbert Edelsbrunner,et al.  An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere , 1995, Comput. Aided Geom. Des..