[{"date_created":"2018-12-11T12:06:24Z","conference":{"start_date":"2000-11-12","end_date":"2000-11-14","location":"Washington, DC, United States","name":"FOCS: Foundations of Computer Science"},"date_published":"2000-11-01T00:00:00Z","year":"2000","doi":"10.1109/SFCS.2000.892133","month":"11","language":[{"iso":"eng"}],"publisher":"IEEE","title":"Topological persistance and simplification","publist_id":"2116","date_updated":"2023-04-25T06:53:21Z","page":"454 - 463","article_processing_charge":"No","publication":"Proceedings 41st Annual Symposium on Foundations of Computer Science","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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.","oa_version":"None","quality_controlled":"1","_id":"4008","publication_identifier":{"isbn":["0769508502"]},"extern":"1","type":"conference","publication_status":"published","day":"01","citation":{"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.","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>","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>.","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.","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>"},"author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","first_name":"Herbert"},{"last_name":"Letscher","full_name":"Letscher, David","first_name":"David"},{"first_name":"Afra","full_name":"Zomorodian, Afra","last_name":"Zomorodian"}],"status":"public","abstract":[{"lang":"eng","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."}]}]