A deterministic \(O(m \log {m})\) time algorithm for the Reeb graph
From MaRDI portal
Publication:2391712
DOI10.1007/s00454-013-9511-3zbMath1269.05067MaRDI QIDQ2391712
Publication date: 5 August 2013
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-013-9511-3
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
05C40: Connectivity
Related Items
Unnamed Item, Revisiting graph persistence for updates and efficiency, A Refined Definition for Groups of Moving Entities and Its Computation
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient algorithms for computing Reeb graphs
- Time-varying Reeb graphs for continuous space-time data
- A data structure for dynamic trees
- Computing contour trees in all dimensions
- Reeb graphs for shape analysis and applications
- Maintaining information in fully dynamic trees with top trees
- Near-optimal fully-dynamic graph connectivity
- Reeb spaces of piecewise linear mappings
- Self-adjusting binary search trees
- Offline Algorithms for Dynamic Minimum Spanning Tree Problems
- THE AUGMENTED MULTIRESOLUTION REEB GRAPH APPROACH FOR CONTENT-BASED RETRIEVAL OF 3D SHAPES
- Loops in reeb graphs of 2-manifolds
- Reeb graphs
- A randomized O ( m log m ) time algorithm for computing Reeb graphs of arbitrary simplicial complexes
- Dynamic trees in practice
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
- Logarithmic Lower Bounds in the Cell-Probe Model
