Approximate Čech Complex in Low and High Dimensions

DOI10.1007/978-3-642-45030-3_62zbMath1406.68119arXiv1307.3272OpenAlexW2964062532MaRDI QIDQ2872131

R. Sharathkumar, Michael Kerber

Publication date: 14 January 2014

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1307.3272

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Simplicial sets and complexes in algebraic topology (55U10) General topics in the theory of data (68P01)

Related Items (13)

Strong collapse and persistent homology ⋮ The Offset Filtration of Convex Objects ⋮ Barcodes of towers and a streaming algorithm for persistent homology ⋮ Unnamed Item ⋮ Topological data analysis of noise: uniform unimodal distributions ⋮ Quantitative simplification of filtered simplicial complexes ⋮ Polynomial-sized topological approximations using the permutahedron ⋮ Persistent Homology of Geospatial Data: A Case Study with Voting ⋮ Strong Collapse for Persistence ⋮ Improved approximate Rips filtrations with shifted integer lattices and cubical complexes ⋮ Improved Approximate Rips Filtrations with Shifted Integer Lattices ⋮ Computing Persistent Homology of Flag Complexes via Strong Collapses ⋮ Approximating persistent homology in Euclidean space through collapses

This page was built for publication: Approximate Čech Complex in Low and High Dimensions