Hierarchies and Ranks for Persistence Pairs
From MaRDI portal
Publication:5147725
DOI10.1007/978-3-030-43036-8_1zbMath1479.55013arXiv1907.13495OpenAlexW2965311640MaRDI QIDQ5147725
F. Sadlo, Heike Leitte, Bastian Rieck
Publication date: 28 January 2021
Published in: Mathematics and Visualization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.13495
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey on tree edit distance and related problems
- Stability of persistence diagrams
- Efficient algorithms for computing Reeb graphs
- Localized homology
- Lipschitz functions have \(L_{p}\)-stable persistence
- The theory of multidimensional persistence
- Computing contour trees in all dimensions
- Homology and robustness of level and interlevel sets
- Stabilizing the unstable output of persistent homology computations
- The Gudhi Library: Simplicial Complexes and Persistent Homology
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
- Measuring the Distance Between Merge Trees
- The TOPORRERY: computation and presentation of multi-resolution topology
- Morse Theory. (AM-51)
- Measuring Distance between Reeb Graphs
- Zigzag persistent homology and real-valued functions
- Persistence-Based Clustering in Riemannian Manifolds
This page was built for publication: Hierarchies and Ranks for Persistence Pairs
