{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T06:32:47Z","timestamp":1774333967881,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":32,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819571260","type":"print"},{"value":"9789819571277","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-7127-7_31","type":"book-chapter","created":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T10:07:00Z","timestamp":1770977220000},"page":"467-482","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fundamentals of\u00a0Computing Continuous Dynamic Time Warping in\u00a02D Under Different Norms"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3022-7877","authenticated-orcid":false,"given":"Kevin","family":"Buchin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3446-4343","authenticated-orcid":false,"given":"Maike","family":"Buchin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7936-4795","authenticated-orcid":false,"given":"Jan Erik","family":"Swiadek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3803-3804","authenticated-orcid":false,"given":"Sampson","family":"Wong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,14]]},"reference":[{"issue":"1\u20132","key":"31_CR1","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). https:\/\/doi.org\/10.1142\/S0218195995000064","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"2","key":"31_CR2","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF02187906","volume":"3","author":"C Bajaj","year":"1988","unstructured":"Bajaj, C.: The algebraic degree of geometric optimization problems. Discrete Comput. Geom. 3(2), 177\u2013191 (1988). https:\/\/doi.org\/10.1007\/BF02187906","journal-title":"Discrete Comput. Geom."},{"key":"31_CR3","doi-asserted-by":"publisher","unstructured":"Baker, A.: Transcendental Number Theory. Cambridge University Press (1990). https:\/\/doi.org\/10.1017\/CBO9780511565977. Reissue with updated material","DOI":"10.1017\/CBO9780511565977"},{"key":"31_CR4","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization, 7th edn. Cambridge University Press (2009). https:\/\/web.stanford.edu\/~boyd\/cvxbook\/"},{"key":"31_CR5","unstructured":"Brakatsoulas, S., Pfoser, D., Salas, R., Wenk, C.: On map-matching vehicle tracking data. In: Proceedings of the 31st International Conference on Very Large Data Bases, pp. 853\u2013864. VLDB Endowment (2005). https:\/\/dl.acm.org\/doi\/10.5555\/1083592.1083691"},{"key":"31_CR6","unstructured":"Brankovic, M.: Graphs and trajectories in practical geometric problems. Ph.D. thesis, University of Sydney (2022)"},{"key":"31_CR7","doi-asserted-by":"publisher","unstructured":"Brankovic, M., Buchin, K., Klaren, K., Nusser, A., Popov, A., Wong, S.: $$(k,l)$$-medians clustering of trajectories using Continuous Dynamic Time Warping. In: Proceedings of the 28th International Conference on Advances in Geographic Information Systems, pp. 99\u2013110. ACM (2020). https:\/\/doi.org\/10.1145\/3397536.3422245","DOI":"10.1145\/3397536.3422245"},{"issue":"1","key":"31_CR8","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/S00454-017-9878-7","volume":"58","author":"K Buchin","year":"2017","unstructured":"Buchin, K., Buchin, M., Meulemans, W., Mulzer, W.: Four soviets walk the dog: Improved bounds for computing the Fr\u00e9chet distance. Discrete Comput. Geom. 58(1), 180\u2013216 (2017). https:\/\/doi.org\/10.1007\/S00454-017-9878-7","journal-title":"Discrete Comput. Geom."},{"key":"31_CR9","doi-asserted-by":"publisher","unstructured":"Buchin, K., Buchin, M., Wang, Y.: Exact algorithms for partial curve matching via the Fr\u00e9chet distance. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 645\u2013654. SIAM (2009). https:\/\/doi.org\/10.1137\/1.9781611973068.71","DOI":"10.1137\/1.9781611973068.71"},{"key":"31_CR10","doi-asserted-by":"publisher","unstructured":"Buchin, K., Nusser, A., Wong, S.: Computing continuous dynamic time warping of time series in polynomial time. In: 38th International Symposium on Computational Geometry, pp. 22:1\u201322:16. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPICS.SOCG.2022.22","DOI":"10.4230\/LIPICS.SOCG.2022.22"},{"key":"31_CR11","unstructured":"Buchin, M.: On the Computability of the Fr\u00e9chet distance between triangulated surfaces. Ph.D. thesis, Freie Universit\u00e4t Berlin (2007). https:\/\/refubium.fu-berlin.de\/handle\/fub188\/1909"},{"issue":"1","key":"31_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/7531.24036","volume":"34","author":"B Chazelle","year":"1987","unstructured":"Chazelle, B., Dobkin, D.P.: Intersection of convex objects in two and three dimensions. J. ACM 34(1), 1\u201327 (1987). https:\/\/doi.org\/10.1145\/7531.24036","journal-title":"J. ACM"},{"key":"31_CR13","doi-asserted-by":"publisher","unstructured":"Cheng, S.W., Huang, H.: Fr\u00e9chet distance in subquadratic time. In: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 5100\u20135113. SIAM (2025). https:\/\/doi.org\/10.1137\/1.9781611978322.173","DOI":"10.1137\/1.9781611978322.173"},{"issue":"5","key":"31_CR14","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1016\/J.COMGEO.2014.01.002","volume":"47","author":"JL De Carufel","year":"2014","unstructured":"De Carufel, J.L., Gheibi, A., Maheshwari, A., Sack, J.R., Scheffer, C.: Similarity of polygonal curves in the presence of outliers. Comput. Geom. 47(5), 625\u2013641 (2014). https:\/\/doi.org\/10.1016\/J.COMGEO.2014.01.002","journal-title":"Comput. Geom."},{"issue":"7","key":"31_CR15","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1016\/J.COMGEO.2014.02.004","volume":"47","author":"JL De Carufel","year":"2014","unstructured":"De Carufel, J.L., Grimm, C., Maheshwari, A., Owen, M., Smid, M.: A note on the unsolvability of the weighted region shortest path problem. Comput. Geom. 47(7), 724\u2013727 (2014). https:\/\/doi.org\/10.1016\/J.COMGEO.2014.02.004","journal-title":"Comput. Geom."},{"issue":"3","key":"31_CR16","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/S10851-006-0647-0","volume":"27","author":"A Efrat","year":"2007","unstructured":"Efrat, A., Fan, Q., Venkatasubramanian, S.: Curve matching, time warping, and light fields: new algorithms for computing similarity between curves. J. Math. Imaging Vision 27(3), 203\u2013216 (2007). https:\/\/doi.org\/10.1007\/S10851-006-0647-0","journal-title":"J. Math. Imaging Vision"},{"issue":"1","key":"31_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF03018603","volume":"22","author":"M Fr\u00e9chet","year":"1906","unstructured":"Fr\u00e9chet, M.: Sur quelques points du calcul fonctionnel. Rendiconti Circolo Matematico Palermo 22(1), 1\u201372 (1906). https:\/\/doi.org\/10.1007\/BF03018603","journal-title":"Rendiconti Circolo Matematico Palermo"},{"key":"31_CR18","doi-asserted-by":"publisher","unstructured":"Gold, O., Sharir, M.: Dynamic time warping and geometric edit distance: breaking the quadratic barrier. ACM Trans. Algorithms 14(4), 50:1\u201350:17 (2018). https:\/\/doi.org\/10.1145\/3230734","DOI":"10.1145\/3230734"},{"key":"31_CR19","doi-asserted-by":"publisher","unstructured":"Har-Peled, S., Raichel, B., Robson, E.W.: The Fr\u00e9chet distance unleashed: approximating a dog with a frog. In: 41st International Symposium on Computational Geometry, pp. 54:1\u201354:13. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2025). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2025.54","DOI":"10.4230\/LIPIcs.SoCG.2025.54"},{"key":"31_CR20","unstructured":"Jeffrey, A., Dai, H.H.: Handbook of Mathematical Formulas and Integrals, 4th edn. Elsevier (2008)"},{"key":"31_CR21","unstructured":"Klaren, K.: Continuous dynamic time warping for clustering curves. Master\u2019s thesis, Eindhoven University of Technology (2020). https:\/\/research.tue.nl\/en\/studentTheses\/continuous-dynamic-time-warping-for-clustering-curves"},{"key":"31_CR22","doi-asserted-by":"publisher","unstructured":"Luxemburg, W.A.J.: Arzel\u00e0\u2019s Dominated convergence theorem for the Riemann integral. Am. Math. Monthly 78(9), 970\u2013979 (1971). https:\/\/doi.org\/10.1080\/00029890.1971.11992915","DOI":"10.1080\/00029890.1971.11992915"},{"key":"31_CR23","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/J.COMGEO.2018.01.001","volume":"70\u201371","author":"A Maheshwari","year":"2018","unstructured":"Maheshwari, A., Sack, J.R., Scheffer, C.: Approximating the integral Fr\u00e9chet distance. Comput. Geom. 70\u201371, 13\u201330 (2018). https:\/\/doi.org\/10.1016\/J.COMGEO.2018.01.001","journal-title":"Comput. Geom."},{"key":"31_CR24","doi-asserted-by":"publisher","unstructured":"Munich, M.E., Perona, P.: Continuous dynamic time warping for translation-invariant curve alignment with applications to signature verification. In: Proceedings of the Seventh IEEE International Conference on Computer Vision, pp. 108\u2013115. IEEE (1999). https:\/\/doi.org\/10.1109\/ICCV.1999.791205","DOI":"10.1109\/ICCV.1999.791205"},{"key":"31_CR25","unstructured":"Rote, G.: Lexicographic Fr\u00e9chet matchings. In: Extended abstract from the 30th European Workshop on Computational Geometry (2014). https:\/\/refubium.fu-berlin.de\/handle\/fub188\/15658"},{"key":"31_CR26","doi-asserted-by":"publisher","unstructured":"Schaefer, H.H., Wolff, M.P.: Topological Vector Spaces, 2nd edn. Springer, Cham (1999). https:\/\/doi.org\/10.1007\/978-1-4612-1468-7","DOI":"10.1007\/978-1-4612-1468-7"},{"key":"31_CR27","doi-asserted-by":"publisher","unstructured":"Serra, B., Berthod, M.: Subpixel contour matching using continuous dynamic programming. In: 1994 Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, pp. 202\u2013207. IEEE (1994). https:\/\/doi.org\/10.1109\/CVPR.1994.323830","DOI":"10.1109\/CVPR.1994.323830"},{"key":"31_CR28","doi-asserted-by":"publisher","unstructured":"Serra, B., Berthod, M.: Optimal subpixel matching of contour chains and segments. In: Proceedings of IEEE International Conference on Computer Vision, pp. 402\u2013407. IEEE (1995). https:\/\/doi.org\/10.1109\/ICCV.1995.466911","DOI":"10.1109\/ICCV.1995.466911"},{"issue":"1","key":"31_CR29","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/S00778-019-00574-9","volume":"29","author":"H Su","year":"2020","unstructured":"Su, H., Liu, S., Zheng, B., Zhou, X., Zheng, K.: A survey of trajectory distance measures and performance evaluation. VLDB J. 29(1), 3\u201332 (2020). https:\/\/doi.org\/10.1007\/S00778-019-00574-9","journal-title":"VLDB J."},{"issue":"5","key":"31_CR30","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1080\/15481603.2021.1908927","volume":"58","author":"Y Tao","year":"2021","unstructured":"Tao, Y., et al.: A comparative analysis of trajectory similarity measures. GISci. Remote Sens. 58(5), 643\u2013669 (2021). https:\/\/doi.org\/10.1080\/15481603.2021.1908927","journal-title":"GISci. Remote Sens."},{"issue":"1","key":"31_CR31","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BF01074755","volume":"4","author":"TK Vintsyuk","year":"1968","unstructured":"Vintsyuk, T.K.: Speech discrimination by dynamic programming. Cybern. Syst. Anal. 4(1), 52\u201357 (1968). https:\/\/doi.org\/10.1007\/BF01074755","journal-title":"Cybern. Syst. Anal."},{"issue":"5","key":"31_CR32","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1080\/00029890.2025.2460966","volume":"132","author":"NJ Wildberger","year":"2025","unstructured":"Wildberger, N.J., Rubine, D.: A hyper-Catalan series solution to polynomial equations, and the Geode. Am. Math. Monthly 132(5), 383\u2013402 (2025). https:\/\/doi.org\/10.1080\/00029890.2025.2460966","journal-title":"Am. Math. Monthly"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-7127-7_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T04:11:10Z","timestamp":1774325470000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-7127-7_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819571260","9789819571277"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-7127-7_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"14 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Perugia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 March 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 March 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/mozart.diei.unipg.it\/walcom2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}