{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T20:48:18Z","timestamp":1725828498779},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662483497"},{"type":"electronic","value":"9783662483503"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48350-3_77","type":"book-chapter","created":{"date-parts":[[2015,8,31]],"date-time":"2015-08-31T21:40:34Z","timestamp":1441057234000},"page":"928-940","source":"Crossref","is-referenced-by-count":0,"title":["Computing the Similarity Between Moving Curves"],"prefix":"10.1007","author":[{"given":"Kevin","family":"Buchin","sequence":"first","affiliation":[]},{"given":"Tim","family":"Ophelders","sequence":"additional","affiliation":[]},{"given":"Bettina","family":"Speckmann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,12]]},"reference":[{"issue":"1","key":"77_CR1","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/s00454-009-9152-8","volume":"43","author":"H. Alt","year":"2010","unstructured":"Alt, H., Buchin, M.: Can we compute the similarity between surfaces? Discrete Comput. Geom.\u00a043(1), 78\u201399 (2010)","journal-title":"Discrete Comput. Geom."},{"key":"77_CR2","unstructured":"Alt, H., Efrat, A., Rote, G., Wenk, C.: Matching planar maps. In: Proc. 14th Sympos. Discrete Algorithms, pp. 589\u2013598 (2003)"},{"issue":"01n02","key":"77_CR3","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. Intern. J. Comput. Geom. Appl.\u00a05(01n02), 75\u201391 (1995)","journal-title":"Intern. J. Comput. Geom. Appl."},{"key":"77_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/11841036_8","volume-title":"Algorithms \u2013 ESA 2006","author":"B. Aronov","year":"2006","unstructured":"Aronov, B., Har-Peled, S., Knauer, C., Wang, Y., Wenk, C.: Fr\u00e9chet Distances for Curves, Revisited. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 52\u201363. Springer, Heidelberg (2006)"},{"key":"77_CR5","unstructured":"Brakatsoulas, S., Pfoser, D., Salas, R., Wenk, C.: On map-matching vehicle tracking data. In: Proc. 31st Intern. Conf. VLDB, pp. 853\u2013864 (2005)"},{"key":"77_CR6","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: Foundations of Computer Science, pp. 661\u2013670 (2014)","DOI":"10.1109\/FOCS.2014.76"},{"key":"77_CR7","first-page":"1101","volume":"24","author":"K. Buchin","year":"2010","unstructured":"Buchin, K., Buchin, M., Gudmundsson, J.: Constrained free space diagrams: a tool for trajectory analysis. Intern. J. GIS\u00a024, 1101\u20131125 (2010)","journal-title":"Intern. J. GIS"},{"issue":"3","key":"77_CR8","doi-asserted-by":"publisher","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. Intern. J. Comput. Geom. Appl.\u00a021(3), 253\u2013282 (2011)","journal-title":"Intern. J. Comput. Geom. Appl."},{"key":"77_CR9","doi-asserted-by":"crossref","unstructured":"Buchin, K., Buchin, M., Meulemans, W., Mulzer, W.: Four soviets walk the dog-with an application to Alt\u2019s conjecture. In: Proc. 25th Sympos. Discrete Algorithms, pp. 1399\u20131413 (2014)","DOI":"10.1137\/1.9781611973402.103"},{"key":"77_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-642-15781-3_6","volume-title":"Algorithms \u2013 ESA 2010","author":"K. Buchin","year":"2010","unstructured":"Buchin, K., Buchin, M., Schulz, A.: Fr\u00e9chet distance of surfaces: Some simple hard cases. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part II. LNCS, vol.\u00a06347, pp. 63\u201374. Springer, Heidelberg (2010)"},{"issue":"1\u20132","key":"77_CR11","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.comgeo.2007.08.003","volume":"41","author":"K. Buchin","year":"2008","unstructured":"Buchin, K., Buchin, M., Wenk, C.: Computing the Fr\u00e9chet distance between simple polygons. Comput. Geom. Theory Appl.\u00a041(1\u20132), 2\u201320 (2008)","journal-title":"Comput. Geom. Theory Appl."},{"key":"77_CR12","unstructured":"Buchin, M.: On the Computability of the Fr\u00e9chet Distance Between Triangulated Surfaces. PhD thesis, Free University Berlin, Institute of Computer Science (2007)"},{"key":"77_CR13","doi-asserted-by":"crossref","unstructured":"Buchin, M., Dodge, S., Speckmann, B.: Context-aware similarity of trajectories. In: Proc. 6th Intern. Conf. GIS, pp. 43\u201356 (2012)","DOI":"10.1007\/978-3-642-33024-7_4"},{"key":"77_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-642-22300-6_23","volume-title":"Algorithms and Data Structures","author":"A.F. Cook IV","year":"2011","unstructured":"Cook IV, A.F., Driemel, A., Har-Peled, S., Sherette, J., Wenk, C.: Computing the Fr\u00e9chet distance between folded polygons. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.) WADS 2011. LNCS, vol.\u00a06844, pp. 267\u2013278. Springer, Heidelberg (2011)"},{"issue":"1","key":"77_CR15","doi-asserted-by":"publisher","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.\u00a048(1), 94\u2013127 (2012)","journal-title":"Discrete Comput. Geom."},{"key":"77_CR16","unstructured":"Godau, M.: On the complexity of measuring the similarity between geometric objects in higher dimensions. PhD thesis, Berlin, Freie Universit\u00e4t Berlin, Diss. (1998, 1999)"},{"issue":"1","key":"77_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/2532646","volume":"10","author":"S. Har-Peled","year":"2014","unstructured":"Har-Peled, S., Raichel, B.: The Fr\u00e9chet distance revisited and extended. ACM Transactions on Algorithms\u00a010(1), 3 (2014)","journal-title":"ACM Transactions on Algorithms"},{"issue":"2","key":"77_CR18","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.comgeo.2010.09.008","volume":"44","author":"A. Maheshwari","year":"2011","unstructured":"Maheshwari, A., Sack, J.-R., Shahbaz, K., Zarrabi-Zadeh, H.: Fr\u00e9chet distance with speed limits. Comput. Geom. Theory Appl.\u00a044(2), 110\u2013120 (2011)","journal-title":"Comput. Geom. Theory Appl."}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2015"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48350-3_77","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T16:08:56Z","timestamp":1559232536000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48350-3_77"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662483497","9783662483503"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48350-3_77","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}