A randomized O ( m log m ) time algorithm for computing Reeb graphs of arbitrary simplicial complexes

DOI10.1145/1810959.1811005zbMath1284.68600OpenAlexW2089763657MaRDI QIDQ5405891

William T. Harvey, Yusu Wang, Rephael Wenger

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.1811005

zbMATH Keywords

topologyrandomized algorithmsReeb graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Simplicial sets and complexes in algebraic topology (55U10) Randomized algorithms (68W20)

Related Items (10)

Structure and stability of the one-dimensional Mapper ⋮ Categorified Reeb graphs ⋮ A deterministic \(O(m \log {m})\) time algorithm for the Reeb graph ⋮ Avoiding the global sort: a faster contour tree algorithm ⋮ Tree decomposition of Reeb graphs, parametrized complexity, and applications to phylogenetics ⋮ Reeb graphs: approximation and persistence ⋮ Robust Computations of Reeb Graphs in 2-D Binary Images ⋮ Generalized persistence diagrams for persistence modules over posets ⋮ Unnamed Item ⋮ Gromov-Hausdorff approximation of filamentary structures using Reeb-type graphs

This page was built for publication: A randomized O ( m log m ) time algorithm for computing Reeb graphs of arbitrary simplicial complexes