A deterministic o(m log m) time algorithm for the reeb graph
From MaRDI portal
Publication:2874588
DOI10.1145/2261250.2261289zbMath1293.05193OpenAlexW2052911743MaRDI QIDQ2874588
Publication date: 7 August 2014
Published in: Proceedings of the twenty-eighth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2261250.2261289
General topology of complexes (57Q05) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)
Related Items
Categorified Reeb graphs, Avoiding the global sort: a faster contour tree algorithm, Generalized persistence diagrams for persistence modules over posets, Gromov-Hausdorff approximation of filamentary structures using Reeb-type graphs
