{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:29:55Z","timestamp":1757618995690,"version":"3.44.0"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031987397"},{"type":"electronic","value":"9783031987403"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-98740-3_4","type":"book-chapter","created":{"date-parts":[[2025,7,17]],"date-time":"2025-07-17T23:48:31Z","timestamp":1752796111000},"page":"44-57","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimum-Complexity Graph Simplification Under the\u00a0Fr\u00e9chet-Like Distance"],"prefix":"10.1007","author":[{"given":"Omrit","family":"Filtser","sequence":"first","affiliation":[]},{"given":"Majid","family":"Mirzanezhad","sequence":"additional","affiliation":[]},{"given":"Carola","family":"Wenk","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,18]]},"reference":[{"issue":"3","key":"4_CR1","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s00454-008-9132-4","volume":"43","author":"MA Abam","year":"2010","unstructured":"Abam, M.A., de Berg, M., Hachenberger, P., Zarei, A.: Streaming algorithms for line simplification. Discrete Comput. Geom. 43(3), 497\u2013515 (2010)","journal-title":"Discrete Comput. Geom."},{"issue":"3\u20134","key":"4_CR2","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s00453-005-1165-y","volume":"42","author":"PK Agarwal","year":"2005","unstructured":"Agarwal, P.K., Har-Peled, S., Mustafa, N., Wang, Y.: Near linear time approximation algorithm for curve simplification. Algorithmica 42(3\u20134), 203\u2013219 (2005)","journal-title":"Algorithmica"},{"issue":"101743","key":"4_CR3","first-page":"1","volume":"95","author":"H Akitaya","year":"2021","unstructured":"Akitaya, H., Buchin, M., Kilgus, B., Sijben, S., Wenk, C.: Distance measures for embedded graphs. Comput. Geom. Theory Appl. 95(101743), 1\u201321 (2021)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"1\u20132","key":"4_CR4","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1142\/S0218195995000064","volume":"5","author":"H Alt","year":"1995","unstructured":"Alt, H., Godau, M.: Computing the Fr\u00e9chet distance between two polygonal curves. Int. J. Comput. Geom. Appl. 5(1\u20132), 75\u201391 (1995)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"2","key":"4_CR5","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/s00453-001-0096-5","volume":"33","author":"G Barequet","year":"2002","unstructured":"Barequet, G., Chen, D.Z., Daescu, O., Goodrich, M.T., Snoeyink, J.: Efficiently approximating polygonal paths in three and higher dimensions. Algorithmica 33(2), 150\u2013167 (2002)","journal-title":"Algorithmica"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1007\/978-3-540-78773-0_54","volume-title":"LATIN 2008: Theoretical Informatics","author":"S Bereg","year":"2008","unstructured":"Bereg, S., Jiang, M., Wang, W., Yang, B., Zhu, B.: Simplifying 3D polygonal chains under the discrete Fr\u00e9chet distance. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 630\u2013641. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78773-0_54"},{"issue":"4","key":"4_CR7","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1559\/152304098782383007","volume":"25","author":"M de Berg","year":"1998","unstructured":"de Berg, M., van Kreveld, M., Schirra, S.: Topologically correct subdivision simplification using the bandwidth criterion. Cartogr. Geograph. Inf. Syst. 25(4), 243\u2013257 (1998)","journal-title":"Cartogr. Geograph. Inf. Syst."},{"issue":"3","key":"4_CR8","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1261\/rna.2164906","volume":"12","author":"E Bindewald","year":"2006","unstructured":"Bindewald, E., Shapiro, B.: RNA secondary structure prediction from sequence alignments using a network of k-nearest neighbor classifiers. RNA 12(3), 342\u2013352 (2006)","journal-title":"RNA"},{"key":"4_CR9","doi-asserted-by":"publisher","unstructured":"Bringmann, K., Chaudhury, B.R.: Polyline simplification has cubic complexity. J. Comput. Geom. 11(2), 94\u2013130 (2021). https:\/\/doi.org\/10.20382\/jocg.v11i2a5, https:\/\/doi.org\/10.20382\/jocg.v11i2a5. Special Issue of Selected Papers from SoCG 2019","DOI":"10.20382\/jocg.v11i2a5"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Buzer, L.: Optimal simplification of polygonal chain for rendering. In: Proceedings of the 23rd Annual ACM Symposium on Computational Geometry (SoCG), pp. 168\u2013174 (2007)","DOI":"10.1145\/1247069.1247102"},{"issue":"1","key":"4_CR11","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1142\/S0218195996000058","volume":"6","author":"S Chan","year":"1996","unstructured":"Chan, S., Chin, F.: Approximation of polygonal curves with minimum number of line segments or minimum error. Int. J. Comput. Geom. Appl. 6(1), 59\u201377 (1996)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"3","key":"4_CR12","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.comgeo.2004.09.003","volume":"32","author":"DZ Chen","year":"2005","unstructured":"Chen, D.Z., Daescu, O., Hershberger, J., Kogge, P.M., Mi, N., Snoeyink, J.: Polygonal path simplification with angle constraints. Comput. Geom. 32(3), 173\u2013187 (2005)","journal-title":"Comput. Geom."},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Cheng, S.W., Huang, H.: Curve simplification and clustering under Fr\u00e9chet distance. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1414 \u2013 1432 (2023)","DOI":"10.1137\/1.9781611977554.ch51"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Cheng, S.W., Huang, H.: Solving Fr\u00e9chet distance problems by algebraic geometric methods. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 4502\u20134513 (2024)","DOI":"10.1137\/1.9781611977912.158"},{"key":"4_CR15","unstructured":"Cheng, S.W., Huang, H., Jiang, L.: Simplification of trajectory streams (2025). https:\/\/arxiv.org\/abs\/2503.23025"},{"issue":"1","key":"4_CR16","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0097-8493(97)00082-4","volume":"22","author":"P Cignoni","year":"1998","unstructured":"Cignoni, P., Montani, C., Scopigno, R.: A comparison of mesh simplification algorithms. Comput. Graph. 22(1), 37\u201354 (1998)","journal-title":"Comput. Graph."},{"issue":"2","key":"4_CR17","doi-asserted-by":"publisher","first-page":"112","DOI":"10.3138\/FM57-6770-U75U-7727","volume":"10","author":"DH Douglas","year":"1973","unstructured":"Douglas, D.H., Peucker, T.K.: Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. Cartographica 10(2), 112\u2013122 (1973)","journal-title":"Cartographica"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Estkowski, R., Mitchell, J.S.B.: Simplifying a polygonal subdivision while keeping it simple. In: Proceedings 17th Annual ACM Symposium on Computational Geometry, SCG 2001, pp. 40\u201349 (2001)","DOI":"10.1145\/378583.378612"},{"key":"4_CR19","unstructured":"Filtser, O., Mirzanezhad, M., Wenk, C.: Minimum-complexity graph simplification under Fr\u00e9chet-like distances (2021). https:\/\/arxiv.org\/abs\/2111.02591"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Funke, S., Mendel, T., Miller, A., Storandt, S., Wiebe, M.: Map simplification with topology constraints: exactly and in practice. In: Proc. 19th Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 185\u2013196 (2017)","DOI":"10.1137\/1.9781611974768.15"},{"key":"4_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BFb0020793","volume-title":"STACS 91","author":"M Godau","year":"1991","unstructured":"Godau, M.: A natural metric for curves\u2014computing the distance for polygonal chains and approximation algorithms. In: Choffrut, C., Jantzen, M. (eds.) STACS 1991. LNCS, vol. 480, pp. 127\u2013136. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/BFb0020793"},{"key":"4_CR22","doi-asserted-by":"publisher","unstructured":"Gudmundsson, J., Laube, P., Wolle, T.: Movement patterns in spatio-temporal data. In: Shekhar, S., Xiong, H., Zhou, X. (eds.) Encyclopedia of GIS, pp. 1362\u20131370. Springer, Cham (2007). https:\/\/doi.org\/10.1007\/978-3-319-17885-1_823","DOI":"10.1007\/978-3-319-17885-1_823"},{"issue":"4","key":"4_CR23","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1142\/S0218195993000257","volume":"3","author":"L Guibas","year":"1993","unstructured":"Guibas, L., Hershberger, J., Mitchell, J., Snoeyink, J.: Approximating polygons and subdivisions with minimum-link paths. Int. J. Comput. Geom. Appl. 3(4), 383\u2013415 (1993)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"3","key":"4_CR24","first-page":"159","volume":"9","author":"H Imai","year":"1986","unstructured":"Imai, H., Iri, M.: An optimal algorithm for approximating a piecewise linear function. J. Inf. Process. 9(3), 159\u2013162 (1986)","journal-title":"J. Inf. Process."},{"key":"4_CR25","volume-title":"Computational Morphology: A Computational Geometric Approach to the Analysis of Form","author":"H Imai","year":"1988","unstructured":"Imai, H., Iri, M.: Polygonal approximations of a curve - formulations and algorithms. In: Toussaint, G.T. (ed.) Computational Morphology: A Computational Geometric Approach to the Analysis of Form. North-Holland, Amsterdam (1988)"},{"key":"4_CR26","unstructured":"van\u00a0de Kerkhof, M., Kostitsyna, I., L\u00f6ffler, M., Mirzanezhad, M., Wenk, C.: Global curve simplification. In: 27th Annual European Symposium on Algorithms (ESA 2019), Dagstuhl, Germany, vol.\u00a0144, pp. 1\u201314 (2019). http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2019\/11188"},{"key":"4_CR27","unstructured":"van\u00a0Kreveld, M., L\u00f6ffler, M., Wiratma, L.: On optimal polyline simplification using the Hausdorff and Fr\u00e9chet distance. In: Proceedings of the 34th International Symposium on Computational Geometry (SoCG), vol.\u00a056, pp. 1\u201314 (2018)"},{"issue":"3","key":"4_CR28","first-page":"440","volume":"3","author":"Y Lee","year":"1991","unstructured":"Lee, Y.: Handwritten digit recognition using k nearest-neighbor, radial-basis function, and backpropagation neural networks. Neitrul Comput. 3(3), 440\u2013449 (1991)","journal-title":"Neitrul Comput."},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"Mendal, T.: Area-preserving subdivision simplification with topology constraints: exactly and in practice. In: Proceedings of the 20th Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 117\u2013128 (2018)","DOI":"10.1137\/1.9781611975055.11"},{"key":"4_CR30","unstructured":"Meulemans, W.: Similarity measures and algorithms for cartographic schematization. Ph.D. thesis, Eindhoven University of Technology, Eindhoven University of Technology (2014)"},{"key":"4_CR31","doi-asserted-by":"publisher","unstructured":"Sester, M.: Cartographic generalization. J. Spat. Inf. Sci. (21), 5\u201311 (2020). https:\/\/doi.org\/10.5311\/JOSIS.2020.21.716. Invited Article 2","DOI":"10.5311\/JOSIS.2020.21.716"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-98740-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,7]],"date-time":"2025-09-07T13:42:43Z","timestamp":1757252563000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-98740-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031987397","9783031987403"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-98740-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"18 July 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bozeman, MT","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"36","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.montana.edu\/bhz\/iwoca2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}