Efficient Output-Sensitive Construction of Reeb Graphs

DOI10.1007/978-3-540-92182-0_50MaRDI QIDQ3596749zbMATH OpenOpenAlexFDO

Authors Harish Doraiswamy, Vijay Natarajan

Publication date 29 January 2009

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-92182-0_50

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Efficient algorithms for computing Reeb graphs
• An efficient computation of handle and tunnel loops via Reeb graphs
• A deterministic \(O(m \log m)\) time algorithm for the Reeb graph
• Note on an algorithm for computing the Reeb graph
• A deterministic \(O(m \log {m})\) time algorithm for the Reeb graph
• Efficient construction of broadcast graphs
• Efficient graph rewriting and its implementation
• Optimal constructions of reversible digraphs
• Efficient reassembling of graphs. I: The linear case
• A randomized O ( m log m ) time algorithm for computing Reeb graphs of arbitrary simplicial complexes

Cited in

(9)

• Constructing Reeb graphs using cylinder maps
• Efficient algorithms for computing Reeb graphs
• Reeb graphs: approximation and persistence
• Robust computations of Reeb graphs in 2-D binary images
• Categorified Reeb graphs
• Reconstituting beta graphs into an efficacious system
• Enhanced topology-sensitive clustering by Reeb graph shattering
• Topological subdivision graphs for comparative and multifield visualization
• A deterministic \(O(m \log m)\) time algorithm for the Reeb graph

This page was built for publication: Efficient Output-Sensitive Construction of Reeb Graphs

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