Compression for 2-parameter persistent homology
From MaRDI portal
Publication:2096383
DOI10.1016/J.COMGEO.2022.101940OpenAlexW3183240028WikidataQ114195410 ScholiaQ114195410MaRDI QIDQ2096383FDOQ2096383
Publication date: 16 November 2022
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.10924
Persistent homology and applications, topological data analysis (55N31) Applied homological algebra and category theory in algebraic topology (55Uxx) Computing methodologies and applications (68Uxx)
Cites Work
- \textsc{Phat} -- persistent homology algorithms toolbox
- The theory of multidimensional persistence
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Categories and Sheaves
- Efficient and robust persistent homology for measures
- Clear and Compress: Computing Persistent Homology in Chunks
- Morse theory for filtrations and efficient computation of persistent homology
- Linear-size approximations to the Vietoris-Rips filtration
- Reducing complexes in multidimensional persistent homology theory
- Approximating persistent homology in Euclidean space through collapses
- The Multi-cover Persistence of Euclidean Balls
- Polynomial-sized topological approximations using the permutahedron
- Multiparameter Persistence Landscapes
- Geometry Helps to Compare Persistence Diagrams
- Strong Collapse for Persistence
- SimBa: An Efficient Tool for Approximating Rips-filtration Persistence via Simplicial Batch-collapse
- Title not available (Why is that?)
- Fast Minimal Presentations of Bi-graded Persistence Modules
- Title not available (Why is that?)
- Improved Topological Approximations by Digitization
- Edge Collapse and Persistence of Flag Complexes
- Efficient Approximation of the Matching Distance for 2-Parameter Persistence
Cited In (1)
Uses Software
Recommendations
- Clear and Compress: Computing Persistent Homology in Chunks 👍 👎
- Persistent homology computation using combinatorial map simplification 👍 👎
- Simplification of complexes for persistent homology computations 👍 👎
- Combinatorial presentation of multidimensional persistent homology 👍 👎
- The compressed annotation matrix: an efficient data structure for computing persistent cohomology 👍 👎
- The compressed annotation matrix: an efficient data structure for computing persistent cohomology 👍 👎
- Efficient and robust persistent homology for measures 👍 👎
- Efficient and Robust Persistent Homology for Measures 👍 👎
- Title not available (Why is that?) 👍 👎
- Computing Minimal Presentations and Bigraded Betti Numbers of 2-Parameter Persistent Homology 👍 👎
This page was built for publication: Compression for \(2\)-parameter persistent homology
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096383)
