Topological persistance and simplification

H. Edelsbrunner, D. Letscher, A. Zomorodian, in:, IEEE, 2000, pp. 454–463.

No fulltext has been uploaded. References only!

Conference Paper | Published
Edelsbrunner, HerbertIST Austria ; Letscher, David; Zomorodian, Afra
We 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 life-time or persistence within the filtration. We give fast algorithms for computing persistence and experimental evidence for their speed and utility.
Publishing Year
Date Published
ARO under grant DAAG55-98-1-0177, NSF under grant CCR-97-12088.
454 - 463
FOCS: Foundations of Computer Science

Cite this

Edelsbrunner H, Letscher D, Zomorodian A. Topological persistance and simplification. In: IEEE; 2000:454-463. doi:10.1109/SFCS.2000.892133
Edelsbrunner, H., Letscher, D., & Zomorodian, A. (2000). Topological persistance and simplification (pp. 454–463). Presented at the FOCS: Foundations of Computer Science, IEEE.
Edelsbrunner, Herbert, David Letscher, and Afra Zomorodian. “Topological Persistance and Simplification,” 454–63. IEEE, 2000.
H. Edelsbrunner, D. Letscher, and A. Zomorodian, “Topological persistance and simplification,” presented at the FOCS: Foundations of Computer Science, 2000, pp. 454–463.
Edelsbrunner H, Letscher D, Zomorodian A. 2000. Topological persistance and simplification. FOCS: Foundations of Computer Science, 454–463.
Edelsbrunner, Herbert, et al. Topological Persistance and Simplification. IEEE, 2000, pp. 454–63, doi:10.1109/SFCS.2000.892133.


Marked Publications

Open Data IST Research Explorer

Search this title in

Google Scholar