An efficient computation of handle and tunnel loops via Reeb graphs. A special family of non-trivial loops on a surface called handle and tunnel loops associates closely to geometric features of “handles” and “tunnels” respectively in a 3D model. The identification of these handle and tunnel loops can benefit a broad range of applications from topology simplification/repair, and surface parameterization, to feature and shape recognition. Many of the existing efficient algorithms for computing non-trivial loops cannot be used to compute these special type of loops. The two algorithms known for computing handle and tunnel loops provably have a serious drawback that they both require a tessellation of the interior and exterior spaces bounded by the surface. Computing such a tessellation of three dimensional space around the surface is a non-trivial task and can be quite expensive. Furthermore, such a tessellation may need to refine the surface mesh, thus causing the undesirable side-effect of outputting the loops on an altered surface mesh. In this paper, we present an efficient algorithm to compute a basis for handle and tunnel loops without requiring any 3D tessellation. This saves time considerably for large meshes making the algorithm scalable while computing the loops on the original input mesh and not on some refined version of it. We use the concept of the Reeb graph which together with several key theoretical insights on linking number provide an initial set of loops that provably constitute a handle and a tunnel basis. We further develop a novel strategy to tighten these handle and tunnel basis loops to make them geometrically relevant. We demonstrate the efficiency and effectiveness of our algorithm as well as show its robustness against noise, and other anomalies in the input.
Keywords for this software
References in zbMATH (referenced in 5 articles , 1 standard article )
Showing results 1 to 5 of 5.
- Stefanou, Anastasios: Tree decomposition of Reeb graphs, parametrized complexity, and applications to phylogenetics (2020)
- Zhao, Rundong; Wang, Menglun; Chen, Jiahui; Tong, Yiying; Wei, Guo-Wei: The de Rham-Hodge analysis and modeling of biomolecules (2020)
- de Silva, Vin; Munch, Elizabeth; Patel, Amit: Categorified Reeb graphs (2016)
- Erickson, Jeff: Efficiently hex-meshing things with topology (2014)
- Dey, Tamal K.; Fan, Fengtao; Wang, Yusu: An efficient computation of handle and tunnel loops via Reeb graphs (2013)