Discrete & Computational Geometry

, Volume 28, Issue 4, pp 511–533

Topological Persistence and Simplification

  • Edelsbrunner
  • Letscher
  • Zomorodian
Article

DOI: 10.1007/s00454-002-2885-2

Cite this article as:
Edelsbrunner, Letscher & Zomorodian Discrete Comput Geom (2002) 28: 511. doi:10.1007/s00454-002-2885-2

Abstract

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 lifetime or persistence within the filtration. We give fast algorithms for computing persistence and experimental evidence for their speed and utility.

Copyright information

© Springer-Verlag New York Inc. 2002

Authors and Affiliations

  • Edelsbrunner
    • 1
  • Letscher
    • 2
  • Zomorodian
    • 3
  1. 1.Department of Computer Science, Duke University, Durham, NC 27708, USA and Raindrop Geomagic, Research Triangle Park, NC, USAUSA
  2. 2.Department of Mathematics, Oklahoma State University, Stillwater, OK 74078, USAUSA
  3. 3.Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL 61801, USAUSA

Personalised recommendations