Adaptive approximation of persistent homology

DOI10.1007/S41468-024-00192-7MaRDI QIDQ6669853zbMATH OpenFDO

Authors Maria Herick, Michael Joachim, Jan Vahrenhold

Publication date 22 January 2025

Published in Journal of Applied and Computational Topology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

persistent homologytopological data analysispersistence diagramslocal feature size

Mathematics Subject Classification ID

Persistent homology and applications, topological data analysis (55N31) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Topological data analysis (62R40)

Recommendations

• On \(\varepsilon \) approximations of persistence diagrams
• Efficient and robust persistent homology for measures
• SimBa: an efficient tool for approximating Rips-filtration persistence via simplicial batch collapse
• Simplification of complexes for persistent homology computations

Cites work

• scientific article; zbMATH DE number 437532 (Why is no real title available?)
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 2103273 (Why is no real title available?)
• scientific article; zbMATH DE number 2119739 (Why is no real title available?)
• Approximate Čech Complex in Low and High Dimensions
• Approximating persistent homology in Euclidean space through collapses
• Computational topology. An introduction
• Computing persistent homology
• Computing topological persistence for simplicial maps (extended abstract)
• Coverage in sensor networks via persistent homology
• Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
• From geometry to topology: inverse theorems for distributed persistence
• Improved approximate Rips filtrations with shifted integer lattices and cubical complexes
• Induced matchings and the algebraic stability of persistence barcodes
• Multidimensional binary search trees used for associative searching
• Normal and Feature Approximations from Noisy Point Clouds
• PERSISTENCE BARCODES FOR SHAPES
• Parameter-free topology inference and sparsification for data on manifolds
• Proximity of persistence modules and their diagrams
• Reconstruction using witness complexes
• Ripser: efficient computation of Vietoris-Rips persistence barcodes
• SimBa: an efficient tool for approximating Rips-filtration persistence via simplicial batch collapse
• Simplification of complexes for persistent homology computations
• Stochastic convergence of persistence landscapes and silhouettes
• Strong Collapse for Persistence
• Surface reconstruction by Voronoi filtering
• The Gudhi library: simplicial complexes and persistent homology
• The power crust, unions of balls, and the medial axis transform
• Topological persistence and simplification
• Zigzag persistent homology in matrix multiplication time
• \textsc{Phat} -- persistent homology algorithms toolbox

Cited in

(1)

• Approximating 1-Wasserstein distance between persistence diagrams by graph sparsification

This page was built for publication: Adaptive approximation of persistent homology

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6669853)