Computational complexity of combinatorial surfaces
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
An incremental algorithm for Betti numbers of simplicial complexes on the 3-spheres
Computer Aided Geometric Design - Special issue on grid generation, finite elements, and geometric design
Controlled simplification of genus for polygonal models
VIS '97 Proceedings of the 8th conference on Visualization '97
GRIN'01 No description on Graphics interface 2001
Removing excess topology from isosurfaces
ACM Transactions on Graphics (TOG)
Greedy optimal homotopy and homology generators
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Medial axis approximation and unstable flow complex
Proceedings of the twenty-second annual symposium on Computational geometry
Stability and homotopy of a subset of the medial axis
SM '04 Proceedings of the ninth ACM symposium on Solid modeling and applications
Topology Repair of Solid Models Using Skeletons
IEEE Transactions on Visualization and Computer Graphics
Defining and computing curve-skeletons with medial geodesic function
SGP '06 Proceedings of the fourth Eurographics symposium on Geometry processing
Computing shortest cycles using universal covering space
The Visual Computer: International Journal of Computer Graphics
Computing geometry-aware handle and tunnel loops in 3D models
ACM SIGGRAPH 2008 papers
Euclidean geodesic loops on high-genus surfaces applied to the morphometry of vestibular systems
MICCAI'11 Proceedings of the 14th international conference on Medical image computing and computer-assisted intervention - Volume Part II
Hi-index | 0.00 |
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.