Reeb graphs, approximation and persistence
From MaRDI portal
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Geometries with algebraic manifold structure (51H30)
Recommendations
Cited in
(16)- Constructing Reeb graphs using cylinder maps
- Maintaining Reeb graphs of triangulated 2-manifolds
- Reeb graphs: approximation and persistence
- Reeb graphs of piecewise linear functions
- A randomized O ( m log m ) time algorithm for computing Reeb graphs of arbitrary simplicial complexes
- Gromov-Hausdorff approximation of filamentary structures using Reeb-type graphs
- A deterministic \(O(m \log {m})\) time algorithm for the Reeb graph
- Note on an algorithm for computing the Reeb graph
- The JS-graphs of join and split trees (extended abstract)
- Gromov-Hausdorff approximation of filament structure using Reeb-type graph (extended abstract)
- Stability of Reeb Graphs of Closed Curves
- Time-varying Reeb graphs for continuous space-time data
- Reeb graphs for shape analysis and applications
- Time-varying Reeb graphs for continuous space-time data
- Approximation of metric spaces by Reeb graphs: Cycle rank of a Reeb graph, the co-rank of the fundamental group, and large components of level sets on Riemannian manifolds
- Reeb graphs through local binary patterns
This page was built for publication: Reeb graphs, approximation and persistence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5404428)