Topological Persistence and Simplification. Edelsbrunner, H., Letscher, D., & Zomorodian, A. In Proceedings 41st Annual Symposium on Foundations of Computer Science, pages 454-463.
doi  abstract   bibtex   
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.
@inproceedings{edelsbrunnerTopologicalPersistenceSimplification2000,
  title = {Topological Persistence and Simplification},
  doi = {10.1109/SFCS.2000.892133},
  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.},
  eventtitle = {Proceedings 41st {{Annual Symposium}} on {{Foundations}} of {{Computer Science}}},
  booktitle = {Proceedings 41st {{Annual Symposium}} on {{Foundations}} of {{Computer Science}}},
  date = {2000-11},
  pages = {454-463},
  keywords = {Topology,History,computational topology,algorithm theory,alpha shapes,computational geometry,Computational geometry,Computer graphics,Computer science,Density functional theory,fast algorithms,filtration,Filtration,growing complex,homology groups,Mathematics,Noise shaping,Shape,topological change,topological persistence,topological simplification,topology},
  author = {Edelsbrunner, H. and Letscher, D. and Zomorodian, A.},
  file = {/home/dimitri/Nextcloud/Zotero/storage/5LPIWG5Z/892133.html}
}

Downloads: 0