An efficient computation of handle and tunnel loops via Reeb graphs
From MaRDI portal
Publication:5174654
DOI10.1145/2461912.2462017zbMath1305.68226OpenAlexW2171603394MaRDI QIDQ5174654
Fengtao Fan, Yusu Wang, Tamal Krishna Dey
Publication date: 18 February 2015
Published in: ACM Transactions on Graphics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2461912.2462017
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Geometries with algebraic manifold structure (51H30)
Related Items
Categorified Reeb graphs ⋮ Feature-aware reconstruction of trimmed splines using Ricci flow with metric optimization ⋮ Tree decomposition of Reeb graphs, parametrized complexity, and applications to phylogenetics ⋮ The de Rham-Hodge analysis and modeling of biomolecules ⋮ Efficiently hex-meshing things with topology ⋮ Quadrilateral mesh generation. III: Optimizing singularity configuration based on Abel-Jacobi theory ⋮ ReebHanTun ⋮ 3D mesh cutting for high quality atlas packing
