Skip to main content
Springer Nature Link
Log in
Menu
Find a journal Publish with us Track your research
Search
Cart
  1. Home
  2. Discrete & Computational Geometry
  3. Article

Topological Persistence and Simplification

  • Published: 01 November 2002
  • Volume 28, pages 511–533, (2002)
  • Cite this article
Download PDF
Discrete & Computational Geometry Aims and scope Submit manuscript
Topological Persistence and Simplification
Download PDF
  • Edelsbrunner1,
  • Letscher2 &
  • Zomorodian3 
  • 9487 Accesses

  • 974 Citations

  • 7 Altmetric

  • Explore all metrics

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.

Article PDF

Download to read the full article text

Similar content being viewed by others

Dynamic asymptotic dimension: relation to dynamics, topology, coarse geometry, and \(C^*\)-algebras

Article 28 March 2016

Two folk theorems in topological dynamics

Article 11 February 2016

Filtration Simplification for Persistent Homology via Edge Contraction

Chapter © 2019

Explore related subjects

Discover the latest articles and news from researchers in related subjects, suggested using machine learning.
  • Algebraic Topology
  • Complex Systems
  • Complexity
  • Computational Complexity
  • Topological Groups and Lie Groups
  • Topology
Use our pre-submission checklist

Avoid common mistakes on your manuscript.

Author information

Authors and Affiliations

  1. Department of Computer Science, Duke University, Durham, NC 27708, USA and Raindrop Geomagic, Research Triangle Park, NC, USA, USA

    Edelsbrunner

  2. Department of Mathematics, Oklahoma State University, Stillwater, OK 74078, USA, USA

    Letscher

  3. Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL 61801, USA, USA

    Zomorodian

Authors
  1. Edelsbrunner
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Letscher
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Zomorodian
    View author publications

    You can also search for this author inPubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Edelsbrunner, Letscher & Zomorodian Topological Persistence and Simplification. Discrete Comput Geom 28, 511–533 (2002). https://doi.org/10.1007/s00454-002-2885-2

Download citation

  • Published: 01 November 2002

  • Issue Date: November 2002

  • DOI: https://doi.org/10.1007/s00454-002-2885-2

Share this article

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Use our pre-submission checklist

Avoid common mistakes on your manuscript.

Advertisement

Search

Navigation

  • Find a journal
  • Publish with us
  • Track your research

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Journal finder
  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our brands

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Discover
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support
  • Legal notice
  • Cancel contracts here

136.0.111.243

Not affiliated

Springer Nature

© 2025 Springer Nature

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy