DocumentCode :
2735003
Title :
Topological persistence and simplification
Author :
Edelsbrunner, Herbert ; Letscher, David ; Zomorodian, Afra
Author_Institution :
Dept. of Comput. Sci., Duke Univ., Durham, NC, USA
fYear :
2000
fDate :
2000
Firstpage :
454
Lastpage :
463
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 life-time or persistence within the filtration. We give fast algorithms for completing persistence and experimental evidence for their speed and utility
Keywords :
algorithm theory; computational geometry; topology; alpha shapes; computational geometry; computational topology; fast algorithms; filtration; growing complex; homology groups; topological change; topological persistence; topological simplification; Computational geometry; Computer graphics; Computer science; Density functional theory; Filtration; History; Mathematics; Noise shaping; Shape; Topology;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science, 2000. Proceedings. 41st Annual Symposium on
Conference_Location :
Redondo Beach, CA
ISSN :
0272-5428
Print_ISBN :
0-7695-0850-2
Type :
conf
DOI :
10.1109/SFCS.2000.892133
Filename :
892133
Link To Document :
بازگشت