The tidy set, a minimal simplicial set for computing homology of clique complexes

DOI10.1145/1810959.1811004MaRDI QIDQ5405890zbMATH OpenOpenAlexFDO

Authors Afra Zomorodian

Publication date 3 April 2014

Published in Proceedings of the twenty-sixth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1810959.1811004

zbMATH Keywords

computational topologysimplicial setVietoris-Rips complexwitness complex

Mathematics Subject Classification ID

Simplicial sets and complexes in algebraic topology (55U10) General topology of complexes (57Q05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Quantitative simplification of filtered simplicial complexes
• An output-sensitive algorithm for persistent homology
• Computing Homology: A Global Reduction Approach

Cited in

(9)

• Quantitative simplification of filtered simplicial complexes
• Homotopical decompositions of simplicial and Vietoris Rips complexes
• Approximating persistent homology in Euclidean space through collapses
• Delaunay triangulations of closed Euclidean d-orbifolds
• Topological pattern recognition for point cloud data
• Computing persistent homology of flag complexes via strong collapses
• Singular persistent homology with geometrically parallelizable computation
• Strong collapse and persistent homology
• Stratified simple homotopy type: theory and computation

This page was built for publication: The tidy set, a minimal simplicial set for computing homology of clique complexes

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