Constructing Reeb graphs using cylinder maps

DOI10.1145/1810959.1810979MaRDI QIDQ5405871zbMATH OpenOpenAlexFDO

Authors Harish Doraiswamy, Aneesh Sood, Vijay Natarajan

Publication date 3 April 2014

Published in Proceedings of the twenty-sixth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1810959.1810979

zbMATH Keywords

computational topologyReeb graphslevel set topology

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Geometries with algebraic manifold structure (51H30)

Recommendations

• Efficient algorithms for computing Reeb graphs
• Efficient Output-Sensitive Construction of Reeb Graphs
• A randomized O ( m log m ) time algorithm for computing Reeb graphs of arbitrary simplicial complexes
• Note on an algorithm for computing the Reeb graph
• Reeb graphs, approximation and persistence

Cited in

(6)

• Shape understanding by contour-driven retiling
• Efficient algorithms for computing Reeb graphs
• An efficient computation of handle and tunnel loops via Reeb graphs
• Note on an algorithm for computing the Reeb graph
• The JS-graphs of join and split trees (extended abstract)
• Enhanced topology-sensitive clustering by Reeb graph shattering

This page was built for publication: Constructing Reeb graphs using cylinder maps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5405871)