A deterministic O(m m) time algorithm for the Reeb graph
From MaRDI portal
Publication:2391712
DOI10.1007/S00454-013-9511-3zbMATH Open1269.05067OpenAlexW2473364284MaRDI QIDQ2391712FDOQ2391712
Authors: Salman Parsa 
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
Recommendations
- A deterministic \(O(m \log m)\) time algorithm for the Reeb graph
- A randomized O ( m log m ) time algorithm for computing Reeb graphs of arbitrary simplicial complexes
- Efficient algorithms for computing Reeb graphs
- Note on an algorithm for computing the Reeb graph
- Reeb graphs: approximation and persistence
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)
Cites Work
- A data structure for dynamic trees
- Efficient algorithms for computing Reeb graphs
- Self-adjusting binary search trees
- Computing contour trees in all dimensions
- Reeb graphs for shape analysis and applications
- Self-adjusting top trees
- Maintaining information in fully dynamic trees with top trees
- Reeb spaces of piecewise linear mappings
- Loops in Reeb graphs of 2-manifolds
- A randomized O ( m log m ) time algorithm for computing Reeb graphs of arbitrary simplicial complexes
- Dynamizing static algorithms, with applications to dynamic trees and history independence
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
- Near-optimal fully-dynamic graph connectivity
- Dynamic trees in practice
- THE AUGMENTED MULTIRESOLUTION REEB GRAPH APPROACH FOR CONTENT-BASED RETRIEVAL OF 3D SHAPES
- Logarithmic Lower Bounds in the Cell-Probe Model
- Offline Algorithms for Dynamic Minimum Spanning Tree Problems
- Time-varying Reeb graphs for continuous space-time data
- Reeb graphs, approximation and persistence
Cited In (7)
- Efficient Output-Sensitive Construction of Reeb Graphs
- Maintaining Reeb graphs of triangulated 2-manifolds
- Revisiting graph persistence for updates and efficiency
- A randomized O ( m log m ) time algorithm for computing Reeb graphs of arbitrary simplicial complexes
- A refined definition for groups of moving entities and its computation
- Labeled interleaving distance for Reeb graphs
- A deterministic \(O(m \log m)\) time algorithm for the Reeb graph
This page was built for publication: A deterministic \(O(m \log {m})\) time algorithm for the Reeb graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2391712)
