Computing geometry-aware handle and tunnel loops in 3D models
ACM SIGGRAPH 2008 papers
Surface matching using consistent pants decomposition
Proceedings of the 2008 ACM symposium on Solid and physical modeling
A Java3D framework for inspecting and segmenting 3D models
Web3D '08 Proceedings of the 13th international symposium on 3D web technology
Computing Fundamental Group of General 3-Manifold
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing
Minimum cuts and shortest homologous cycles
Proceedings of the twenty-fifth annual symposium on Computational geometry
Technical Section: Geometry-aware domain decomposition for T-spline-based manifold modeling
Computers and Graphics
Slit map: conformal parameterization for multiply connected surfaces
GMP'08 Proceedings of the 5th international conference on Advances in geometric modeling and processing
Hardness results for homology localization
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Global minimum cuts in surface embedded graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Minimum cuts and shortest non-separating cycles via homology covers
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
SMI 2012: Full Component-aware tensor-product trivariate splines of arbitrary topology
Computers and Graphics
An efficient computation of handle and tunnel loops via Reeb graphs
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
Efficiently hex-meshing things with topology
Proceedings of the twenty-ninth annual symposium on Computational geometry
| 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 identifying 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.