{"status":"public","date_updated":"2023-04-25T06:53:21Z","publication_status":"published","oa_version":"None","citation":{"chicago":"Edelsbrunner, Herbert, David Letscher, and Afra Zomorodian. “Topological Persistance and Simplification.” In <i>Proceedings 41st Annual Symposium on Foundations of Computer Science</i>, 454–63. IEEE, 2000. <a href=\"https://doi.org/10.1109/SFCS.2000.892133\">https://doi.org/10.1109/SFCS.2000.892133</a>.","ieee":"H. Edelsbrunner, D. Letscher, and A. Zomorodian, “Topological persistance and simplification,” in <i>Proceedings 41st Annual Symposium on Foundations of Computer Science</i>, Washington, DC, United States, 2000, pp. 454–463.","mla":"Edelsbrunner, Herbert, et al. “Topological Persistance and Simplification.” <i>Proceedings 41st Annual Symposium on Foundations of Computer Science</i>, IEEE, 2000, pp. 454–63, doi:<a href=\"https://doi.org/10.1109/SFCS.2000.892133\">10.1109/SFCS.2000.892133</a>.","short":"H. Edelsbrunner, D. Letscher, A. Zomorodian, in:, Proceedings 41st Annual Symposium on Foundations of Computer Science, IEEE, 2000, pp. 454–463.","ama":"Edelsbrunner H, Letscher D, Zomorodian A. Topological persistance and simplification. In: <i>Proceedings 41st Annual Symposium on Foundations of Computer Science</i>. IEEE; 2000:454-463. doi:<a href=\"https://doi.org/10.1109/SFCS.2000.892133\">10.1109/SFCS.2000.892133</a>","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.","apa":"Edelsbrunner, H., Letscher, D., &#38; Zomorodian, A. (2000). Topological persistance and simplification. In <i>Proceedings 41st Annual Symposium on Foundations of Computer Science</i> (pp. 454–463). Washington, DC, United States: IEEE. <a href=\"https://doi.org/10.1109/SFCS.2000.892133\">https://doi.org/10.1109/SFCS.2000.892133</a>"},"date_published":"2000-11-01T00:00:00Z","publist_id":"2116","publication":"Proceedings 41st Annual Symposium on Foundations of Computer Science","type":"conference","extern":"1","year":"2000","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","author":[{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"full_name":"Letscher, David","last_name":"Letscher","first_name":"David"},{"first_name":"Afra","full_name":"Zomorodian, Afra","last_name":"Zomorodian"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","publisher":"IEEE","month":"11","page":"454 - 463","publication_identifier":{"isbn":["0769508502"]},"date_created":"2018-12-11T12:06:24Z","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"}],"_id":"4008","language":[{"iso":"eng"}],"doi":"10.1109/SFCS.2000.892133","conference":{"location":"Washington, DC, United States","end_date":"2000-11-14","start_date":"2000-11-12","name":"FOCS: Foundations of Computer Science"},"title":"Topological persistance and simplification","article_processing_charge":"No"}