{"oa_version":"None","quality_controlled":"1","publist_id":"2116","month":"11","citation":{"apa":"Edelsbrunner, H., Letscher, D., & Zomorodian, A. (2000). Topological persistance and simplification. In Proceedings 41st Annual Symposium on Foundations of Computer Science (pp. 454–463). Washington, DC, United States: IEEE. https://doi.org/10.1109/SFCS.2000.892133","short":"H. Edelsbrunner, D. Letscher, A. Zomorodian, in:, Proceedings 41st Annual Symposium on Foundations of Computer Science, IEEE, 2000, pp. 454–463.","ista":"Edelsbrunner H, Letscher D, Zomorodian A. 2000. Topological persistance and simplification. Proceedings 41st Annual Symposium on Foundations of Computer Science. FOCS: Foundations of Computer Science, 454–463.","mla":"Edelsbrunner, Herbert, et al. “Topological Persistance and Simplification.” Proceedings 41st Annual Symposium on Foundations of Computer Science, IEEE, 2000, pp. 454–63, doi:10.1109/SFCS.2000.892133.","chicago":"Edelsbrunner, Herbert, David Letscher, and Afra Zomorodian. “Topological Persistance and Simplification.” In Proceedings 41st Annual Symposium on Foundations of Computer Science, 454–63. IEEE, 2000. https://doi.org/10.1109/SFCS.2000.892133.","ieee":"H. Edelsbrunner, D. Letscher, and A. Zomorodian, “Topological persistance and simplification,” in Proceedings 41st Annual Symposium on Foundations of Computer Science, Washington, DC, United States, 2000, pp. 454–463.","ama":"Edelsbrunner H, Letscher D, Zomorodian A. Topological persistance and simplification. In: Proceedings 41st Annual Symposium on Foundations of Computer Science. IEEE; 2000:454-463. doi:10.1109/SFCS.2000.892133"},"doi":"10.1109/SFCS.2000.892133","article_processing_charge":"No","date_published":"2000-11-01T00:00:00Z","publication_status":"published","date_updated":"2023-04-25T06:53:21Z","date_created":"2018-12-11T12:06:24Z","conference":{"name":"FOCS: Foundations of Computer Science","end_date":"2000-11-14","start_date":"2000-11-12","location":"Washington, DC, United States"},"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["0769508502"]},"year":"2000","title":"Topological persistance and simplification","acknowledgement":"Research by the first and third authors is partially supported by ARO under grant DAAG55-98-1-0177. Research by the first author is also partially supported by NSF under grant CCR-97-12088.","day":"01","page":"454 - 463","type":"conference","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"IEEE","author":[{"orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert"},{"first_name":"David","last_name":"Letscher","full_name":"Letscher, David"},{"last_name":"Zomorodian","full_name":"Zomorodian, Afra","first_name":"Afra"}],"publication":"Proceedings 41st Annual Symposium on Foundations of Computer Science","abstract":[{"text":"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 computing persistence and experimental evidence for their speed and utility.","lang":"eng"}],"status":"public","_id":"4008"}