This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
41st Annual Symposium on Foundations of Computer Science
Topological persistence and simplification
Redondo Beach, California
November 12-November 14
ISBN: 0-7695-0850-2
H. Edelsbrunner, Dept. of Comput. Sci., Duke Univ., Durham, NC, USA
D. Letscher, Dept. of Comput. Sci., Duke Univ., Durham, NC, USA
A. Zomorodian, Dept. of Comput. Sci., Duke Univ., Durham, NC, USA
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 completing persistence and experimental evidence for their speed and utility.
Index Terms:
topology; algorithm theory; computational geometry; topological persistence; topological simplification; filtration; growing complex; topological change; fast algorithms; computational geometry; computational topology; homology groups; alpha shapes
Citation:
H. Edelsbrunner, D. Letscher, A. Zomorodian, "Topological persistence and simplification," focs, pp.454, 41st Annual Symposium on Foundations of Computer Science, 2000
Usage of this product signifies your acceptance of the Terms of Use.