Adaptive approximation of persistent homology

DOI10.1007/S41468-024-00192-7MaRDI QIDQ6669853FDOQ6669853

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)

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

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)

Cites Work

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

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)