{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:25:05Z","timestamp":1759134305215,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030140847"},{"type":"electronic","value":"9783030140854"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-14085-4_8","type":"book-chapter","created":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T16:39:58Z","timestamp":1550853598000},"page":"89-100","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Filtration Simplification for Persistent Homology via Edge Contraction"],"prefix":"10.1007","author":[{"given":"Tamal K.","family":"Dey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryan","family":"Slechta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,2,23]]},"reference":[{"key":"8_CR1","unstructured":"Attali, D., Glisse, M., Morozov, D., Hornus, S., Lazarus, F.: Persistence-sensitive simplification of functions on surfaces in linear time. In: TopoInVis Workshop (2009)"},{"issue":"2","key":"8_CR2","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s00454-011-9357-5","volume":"47","author":"JA Barmak","year":"2012","unstructured":"Barmak, J.A., Minian, E.G.: Strong homotopy types, nerves and collapses. Discrete Comput. Geom. 47(2), 301\u2013328 (2012)","journal-title":"Discrete Comput. Geom."},{"key":"8_CR3","unstructured":"Boissonnat, J., Pritam, S., Pareek, D.: Strong collapse for persistence. In: 26th Annual European Symposium on Algorithms, ESA 2018, pp. 67:1\u201367:13 (2018)"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Chazal, F., Cohen-Steiner, D., Glisse, M., Guibas, L.J., Oudot, S.Y.: Proximity of persistence modules and their diagrams. In: Proceedings of the Twenty-Fifth Annual Symposium on Computational Geometry, SCG 2009, pp. 237\u2013246 (2009)","DOI":"10.1145\/1542362.1542407"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Cohen-Steiner, D., Edelsbrunner, H., Harer, J.: Stability of persistence diagrams. In: Proceedings of the Twenty-First Annual Symposium on Computational Geometry, SCG 2005, pp. 263\u2013271 (2005)","DOI":"10.1145\/1064092.1064133"},{"issue":"80","key":"8_CR6","first-page":"23","volume":"66","author":"TK Dey","year":"1999","unstructured":"Dey, T.K., Edelsbrunner, H., Guha, S., Nekhayev, D.V.: Topology preserving edge contraction. Publ. Inst. Math. (Beograd) (NS) 66(80), 23\u201345 (1999)","journal-title":"Publ. Inst. Math. (Beograd) (NS)"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Dey, T.K., Fan, F., Wang, Y.: Computing topological persistence for simplicial maps. In: Proceedings of the Thirtieth Annual Symposium on Computational Geometry, SOCG 2014, pp. 345:345\u2013345:354 (2014)","DOI":"10.1145\/2582112.2582165"},{"key":"8_CR8","unstructured":"Dey, T.K., Hirani, A.N., Krishnamoorthy, B., Smith, G.: Edge contractions and simplicial homology. arXiv e-prints arXiv:1304.0664, April 2013"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.cag.2018.05.002","volume":"74","author":"TK Dey","year":"2018","unstructured":"Dey, T.K., Slechta, R.: Edge contraction in persistence-generated discrete Morse vector fields. Comput. Graph. 74, 33\u201343 (2018)","journal-title":"Comput. Graph."},{"key":"8_CR10","volume-title":"Computational Topology: An Introduction","author":"H Edelsbrunner","year":"2010","unstructured":"Edelsbrunner, H., Harer, J.: Computational Topology: An Introduction. American Mathematical Society, Providence (2010)"},{"issue":"4","key":"8_CR11","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/s00454-002-2885-2","volume":"28","author":"H Edelsbrunner","year":"2002","unstructured":"Edelsbrunner, H., Letscher, D., Zomorodian, A.: Topological persistence and simplification. Discrete Comput. Geom. 28(4), 511\u2013533 (2002)","journal-title":"Discrete Comput. Geom."},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Hoppe, H., DeRose, T., Duchamp, T., McDonald, J., Stuetzle, W.: Mesh optimization. In: Proceedings of the 20th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 1993, pp. 19\u201326 (1993)","DOI":"10.1145\/166117.166119"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.cag.2017.05.015","volume":"66","author":"F Iuricich","year":"2017","unstructured":"Iuricich, F., De Floriani, L.: Hierarchical forman triangulation: a multiscale model for scalar field analysis. Comput. Graph. 66, 113\u2013123 (2017)","journal-title":"Comput. Graph."},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"1.4:1","DOI":"10.1145\/3064175","volume":"22","author":"M Kerber","year":"2017","unstructured":"Kerber, M., Morozov, D., Nigmetov, A.: Geometry helps to compare persistence diagrams. J. Exp. Algorithmics 22, 1.4:1\u20131.4:20 (2017)","journal-title":"J. Exp. Algorithmics"},{"issue":"3","key":"8_CR15","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/s10208-015-9255-y","volume":"15","author":"M Lesnick","year":"2015","unstructured":"Lesnick, M.: The theory of the interleaving distance on multidimensional persistence modules. Found. Comput. Math. 15(3), 613\u2013650 (2015)","journal-title":"Found. Comput. Math."},{"key":"8_CR16","unstructured":"Lindstrom, P., Turk, G.: Fast and memory efficient polygonal simplification. In: Proceedings Visualization 1998 (Cat. No. 98CB36276), pp. 279\u2013286 (1998)"},{"issue":"1","key":"8_CR17","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0095-8956(83)90079-5","volume":"35","author":"N Robertson","year":"1983","unstructured":"Robertson, N., Seymour, P.: Graph minors. I. Excluding a forest. J. Comb. Theory Ser. B 35(1), 39\u201361 (1983)","journal-title":"J. Comb. Theory Ser. B"}],"container-title":["Lecture Notes in Computer Science","Discrete Geometry for Computer Imagery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-14085-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,19]],"date-time":"2023-03-19T01:07:48Z","timestamp":1679188068000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-14085-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030140847","9783030140854"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-14085-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DGCI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Discrete Geometry for Computer Imagery","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marne-la-Vall\u00e9e","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 March 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 March 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dgci2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dgci2019.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"76% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1-2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}