Testing contractibility in planar rips complexes

DOI10.1145/1377676.1377721zbMath1271.55004OpenAlexW2149966324WikidataQ29041311 ScholiaQ29041311MaRDI QIDQ3602926

Jeff Erickson, Pratik Worah, Erin Wolf Chambers

Publication date: 12 February 2009

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

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

zbMATH Keywords

efficient algorithmRips complexcontractible cycleshortest non-contractible cycle

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Classical topics in algebraic topology (55M99)

Related Items

Random Walks on Simplicial Complexes and the Normalized Hodge 1-Laplacian ⋮ Mayer-Vietoris sequences and coverage problems in sensor networks ⋮ Vietoris-Rips complexes of planar point sets

This page was built for publication: Testing contractibility in planar rips complexes