Reeb graphs: approximation and persistence
From MaRDI portal
Recommendations
- Reeb graphs, approximation and persistence
- Reconstructing embedded graphs from persistence diagrams
- Note on an algorithm for computing the Reeb graph
- Persistent graphs and cyclic polytope triangulations
- Rigidity and reconstruction for graphs
- Efficient algorithms for computing Reeb graphs
- scientific article; zbMATH DE number 3961652
- Steady and ranging sets in graph persistence
- A randomized O ( m log m ) time algorithm for computing Reeb graphs of arbitrary simplicial complexes
- Approximation and decomposition by extremal graphs
Cites work
- A randomized O ( m log m ) time algorithm for computing Reeb graphs of arbitrary simplicial complexes
- Analysis of scalar fields over point cloud data
- Approximating cycles in a shortest basis of the first homology group from point data
- Curve and Surface Reconstruction
- Cut locus and topology from surface point data
- Efficient algorithms for computing Reeb graphs
- Efficient Output-Sensitive Construction of Reeb Graphs
- Extending persistence using Poincaré and Lefschetz duality
- Finding the homology of submanifolds with high confidence from random samples
- scientific article; zbMATH DE number 5506200 (Why is no real title available?)
- scientific article; zbMATH DE number 1344784 (Why is no real title available?)
- scientific article; zbMATH DE number 2103273 (Why is no real title available?)
- Loops in Reeb graphs of 2-manifolds
- Persistence-based clustering in Riemannian manifolds
- Persistent homology -- a survey
- Reeb graphs for shape analysis and applications
- Time-varying Reeb graphs for continuous space-time data
- Topological persistence and simplification
- Towards persistence-based reconstruction in euclidean spaces
- Vietoris-rips complexes also provide topologically correct reconstructions of sampled shapes
- Zigzag persistence
- Zigzag persistent homology and real-valued functions
Cited in
(25)- Structure and stability of the one-dimensional Mapper
- Multiscale persistent functions for biomolecular structure characterization
- Generalized persistence diagrams for persistence modules over posets
- Gromov-Hausdorff approximation of filamentary structures using Reeb-type graphs
- Object-oriented persistent homology
- A deterministic \(O(m \log {m})\) time algorithm for the Reeb graph
- Reeb graphs for shape analysis and applications
- Approximations by graphs and emergence of global structures
- A deterministic O(m m) time algorithm for the Reeb graph
- Reeb graphs through local binary patterns
- Reeb spaces of piecewise linear mappings
- Statistical analysis and parameter selection for Mapper
- Gromov-Hausdorff approximation of filament structure using Reeb-type graph (extended abstract)
- The JS-graphs of join and split trees (extended abstract)
- 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 of piecewise linear functions
- Maintaining Reeb graphs of triangulated 2-manifolds
- Time-varying Reeb graphs for continuous space-time data
- Note on an algorithm for computing the Reeb graph
- Reeb graphs, approximation and persistence
- A randomized O ( m log m ) time algorithm for computing Reeb graphs of arbitrary simplicial complexes
- Labeled interleaving distance for Reeb graphs
- A family of metrics from the truncated smoothing of Reeb graphs
- Efficient algorithms for computing Reeb graphs
- Time-varying Reeb graphs for continuous space-time data
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 Q1942305)
