H. Edelsbrunner, D. Letscher, A. Zomorodian
2000.11.12DISCRETE & COMPUTATIONAL GEOMETRY
tlooto Summary
Fast algorithms for computing persistence and experimental evidence for their speed and utility are given for topological simplification within the framework of a filtration, which is the history of a growing complex.
Abstract
AbstractWe formalize a notion of topological simplification within the framework of a filtration, which is the history of a growing complex. We classify a topological change that happens during growth as either a feature or noise depending on its lifetime or persistence within the filtration. We give fast algorithms for computing persistence and experimental evidence for their speed and utility.
Citation format
EDELSBRUNNER, H.; LETSCHER, D.; ZOMORODIAN, A. Topological persistence and simplification. DISCRETE & COMPUTATIONAL GEOMETRY, 2000, 28: 511–533.