{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T17:19:21Z","timestamp":1775063961666,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,6,22]],"date-time":"2016-06-22T00:00:00Z","timestamp":1466553600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"City University"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s00454-016-9800-8","type":"journal-article","created":{"date-parts":[[2016,6,22]],"date-time":"2016-06-22T20:19:04Z","timestamp":1466626744000},"page":"315-336","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Computing the Fr\u00e9chet Distance with a Retractable Leash"],"prefix":"10.1007","volume":"56","author":[{"given":"Kevin","family":"Buchin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maike","family":"Buchin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"van Leusden","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wouter","family":"Meulemans","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfgang","family":"Mulzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,22]]},"reference":[{"issue":"1\u20132","key":"9800_CR1","first-page":"78","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), 78\u201399 (1995)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"9800_CR2","doi-asserted-by":"crossref","unstructured":"Alt, H., Knauer, C., Wenk, C.: Matching polygonal curves with respect to the Fr\u00e9chet distance. In: Proc. 18th Sympos. Theoret. Aspects Comput. Sci. (STACS), Dresden, pp. 63\u201374. Springer Berlin Heidelberg (2001)","DOI":"10.1007\/3-540-44693-1_6"},{"key":"9800_CR3","unstructured":"Brakatsoulas, S., Pfoser, D., Salas, R., Wenk, C.: On map-matching vehicle tracking data. In: Proc. 31st Int. Conf. on Very Large Data Bases (VLDB), pp. 853\u2013864. VLDB Endowment (2005)"},{"key":"9800_CR4","doi-asserted-by":"crossref","unstructured":"Bringmann, K.: Why walking the dog takes time: Fr\u00e9chet distance has no strongly subquadratic algorithms unless SETH fails. In: Proc. 55th Annu. IEEE Sympos. Found. Comput. Sci. (FOCS), pp. 661\u2013670. IEEE (2014)","DOI":"10.1109\/FOCS.2014.76"},{"issue":"2","key":"9800_CR5","first-page":"46","volume":"7","author":"K Bringmann","year":"2016","unstructured":"Bringmann, K., Mulzer, W.: Approximability of the discrete Fr\u00e9chet distance. J. Comput. Geom. 7(2), 46\u201376 (2016)","journal-title":"J. Comput. Geom."},{"key":"9800_CR6","doi-asserted-by":"crossref","unstructured":"Brodal, G.S., Jacob, R.: Dynamic planar convex hull with optimal query time. In: Proc. 7th Scandinavian Workshop Algorithm Theory (SWAT), pp. 57\u201370. Springer Berlin Heidelberg (2000)","DOI":"10.1007\/3-540-44985-X_7"},{"key":"9800_CR7","doi-asserted-by":"crossref","unstructured":"Brodal, G.S., Jacob, R.: Dynamic planar convex hull. In: Proc. 43rd Annu. IEEE Sympos. Found. Comput. Sci. (FOCS), pp. 617\u2013626. IEEE (2002)","DOI":"10.1109\/SFCS.2002.1181985"},{"key":"9800_CR8","doi-asserted-by":"crossref","unstructured":"Buchin, K., Buchin, M., Gudmundsson, J.: Constrained free space diagrams: a tool for trajectory analysis. Int. J. GIS 24(7), 1101\u20131125 (2010)","DOI":"10.1080\/13658810903569598"},{"issue":"3","key":"9800_CR9","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1142\/S0218195911003652","volume":"21","author":"K Buchin","year":"2011","unstructured":"Buchin, K., Buchin, M., Gudmundsson, J., L\u00f6ffler, M., Luo, J.: Detecting commuting patterns by clustering subtrajectories. Int. J. Comput. Geom. Appl. 21(3), 253\u2013282 (2011)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"9800_CR10","doi-asserted-by":"crossref","unstructured":"Buchin, K., Buchin, M., Meulemans, W., Mulzer, W.: Four Soviets walk the dog \u2013 with an application to Alt\u2019s conjecture. In: Proc. 25th Annu. ACM-SIAM Sympos. Discrete Algorithms (SODA), pp. 1399\u20131413. Society for Industrial and Applied Mathematics, Philadelphia, PA (2014)","DOI":"10.1137\/1.9781611973402.103"},{"key":"9800_CR11","doi-asserted-by":"crossref","unstructured":"Buchin, K., Buchin, M., Meulemans, W., Speckmann, B.: Locally correct Fr\u00e9chet matchings. In: Proc. 20th Annu. European Sympos. Algorithms (ESA), pp. 229\u2013240. Springer Berlin Heidelberg (2012)","DOI":"10.1007\/978-3-642-33090-2_21"},{"issue":"4","key":"9800_CR12","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1142\/S0218195912600096","volume":"22","author":"TM Chan","year":"2012","unstructured":"Chan, T.M.: Three problems about dynamic convex hulls. Int. J. Comput. Geom. Appl. 22(4), 341\u2013364 (2012)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"9800_CR13","doi-asserted-by":"crossref","unstructured":"Cook, A.F., Wenk, C.: Geodesic Fr\u00e9chet distance inside a simple polygon. ACM Trans. Algorithm 7(1) (2010)","DOI":"10.1145\/1868237.1868247"},{"issue":"3","key":"9800_CR14","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1007\/PL00009159","volume":"18","author":"M Berg de","year":"1997","unstructured":"de Berg, M., van Kreveld, M.J.: Trekking in the alps without freezing or getting tired. Algorithmica 18(3), 306\u2013323 (1997)","journal-title":"Algorithmica"},{"issue":"1","key":"9800_CR15","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/s00454-012-9402-z","volume":"48","author":"A Driemel","year":"2012","unstructured":"Driemel, A., Har-Peled, S., Wenk, C.: Approximating the Fr\u00e9chet distance for realistic curves in near linear time. Discrete Comput. Geom. 48(1), 94\u2013127 (2012)","journal-title":"Discrete Comput. Geom."},{"key":"9800_CR16","doi-asserted-by":"crossref","unstructured":"Har-Peled, S., Raichel, B.: The Fr\u00e9chet distance revisited and extended. ACM Trans. Algorithms 10(1) (2014)","DOI":"10.1145\/2532646"},{"key":"9800_CR17","unstructured":"Kaplan, H., Tarjan, R.E., Tsioutsiouliklis, K.: Faster kinetic heaps and their use in broadcast scheduling. In: Proc. 12th Annu. ACM-SIAM Sympos. Discrete Algorithms (SODA), pp. 836\u2013844 (2001)"},{"key":"9800_CR18","unstructured":"Meulemans, W.: Similarity measures and algorithms for cartographic schematization. Ph.D. thesis, Eindhoven University of Technology (2014)"},{"issue":"2","key":"9800_CR19","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/0022-0000(81)90012-X","volume":"23","author":"MH Overmars","year":"1981","unstructured":"Overmars, M.H., van Leeuwen, J.: Maintenance of configurations in the plane. J. Comput. Syst. Sci. 23(2), 166\u2013204 (1981)","journal-title":"J. Comput. Syst. Sci."},{"key":"9800_CR20","doi-asserted-by":"crossref","unstructured":"Wenk, C., Salas, R., Pfoser, D.: Addressing the need for map-matching speed: localizing global curve-matching algorithms. In: Proc. 18th Int. Conf. on Sci. and Stat. Database Management (SSDBM), pp. 379\u2013388. IEEE (2006)","DOI":"10.1109\/SSDBM.2006.11"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-016-9800-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-016-9800-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-016-9800-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,9]],"date-time":"2019-09-09T22:11:42Z","timestamp":1568067102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-016-9800-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,22]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["9800"],"URL":"https:\/\/doi.org\/10.1007\/s00454-016-9800-8","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,22]]}}}