{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:54Z","timestamp":1761611334159},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642404498"},{"type":"electronic","value":"9783642404504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40450-4_48","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T03:22:47Z","timestamp":1376623367000},"page":"565-576","source":"Crossref","is-referenced-by-count":4,"title":["Fr\u00e9chet Queries in Geometric Trees"],"prefix":"10.1007","author":[{"given":"Joachim","family":"Gudmundsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"48_CR1","doi-asserted-by":"crossref","unstructured":"Alt, H.: The computational geometry of comparing shapes. In: Albers, S., Alt, H., N\u00e4her, S. (eds.) Festschrift Mehlhorn. LNCS, vol.\u00a05760, pp. 235\u2013248. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-03456-5_16"},{"issue":"2","key":"48_CR2","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1016\/S0196-6774(03)00085-3","volume":"49","author":"H. Alt","year":"2003","unstructured":"Alt, H., Efrat, A., Rote, G., Wenk, C.: Matching planar maps. Journal of Algorithms\u00a049(2), 262\u2013283 (2003)","journal-title":"Journal of Algorithms"},{"key":"48_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. International Journal of Computational Geometry & Applications\u00a05, 75\u201391 (1995)","journal-title":"International Journal of Computational Geometry & Applications"},{"issue":"1","key":"48_CR4","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s00453-003-1042-5","volume":"38","author":"H. Alt","year":"2003","unstructured":"Alt, H., Knauer, C., Wenk, C.: Comparison of distance measures for planar curves. Algorithmica\u00a038(1), 45\u201358 (2003)","journal-title":"Algorithmica"},{"issue":"6","key":"48_CR5","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1016\/j.comgeo.2012.11.006","volume":"46","author":"M. Berg de","year":"2013","unstructured":"de Berg, M., Cook, A.F., Gudmundsson, J.: Fast Fr\u00e9chet queries. Computational Geometry \u2013 Theory and Applications\u00a046(6), 747\u2013755 (2013)","journal-title":"Computational Geometry \u2013 Theory and Applications"},{"key":"48_CR6","unstructured":"Brakatsoulas, S., Pfoser, D., Salas, R., Wenk, C.: On map-matching vehicle tracking data. In: VLDB, pp. 853\u2013864 (2005)"},{"key":"48_CR7","unstructured":"Buchin, K., Buchin, M., Knauer, C., Rote, G., Wenk, C.: How difficult is it to walk the dog? In: EuroCG, pp. 170\u2013173 (2007)"},{"key":"48_CR8","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. CoRR abs\/1209.4403 (2012)","DOI":"10.1137\/1.9781611973402.103"},{"key":"48_CR9","doi-asserted-by":"crossref","unstructured":"Chen, D., Driemel, A., Guibas, L.J., Nguyen, A., Wenk, C.: Approximate map matching with respect to the Fr\u00e9chet distance. In: ALENEX, pp. 75\u201383 (2011)","DOI":"10.1137\/1.9781611972917.8"},{"key":"48_CR10","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s00454-004-1098-2","volume":"32","author":"S.W. Cheng","year":"2004","unstructured":"Cheng, S.W., Cheong, O., Everett, H., van Oostrum, R.: Hierarchical decompositions and circular ray shooting in simple polygons. Discrete & Computational Geometry\u00a032, 401\u2013415 (2004)","journal-title":"Discrete & Computational Geometry"},{"key":"48_CR11","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/BF01762121","volume":"3","author":"R. Cole","year":"1988","unstructured":"Cole, R., Vishkin, U.: The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time. Algorithmica\u00a03, 329\u2013346 (1988)","journal-title":"Algorithmica"},{"key":"48_CR12","doi-asserted-by":"crossref","unstructured":"Driemel, A., Har-Peled, S.: Jaywalking your dog: computing the Fr\u00e9chet distance with shortcuts. In: SODA, pp. 318\u2013337 (2012)","DOI":"10.1137\/1.9781611973099.30"},{"key":"48_CR13","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 & Computational Geometry\u00a048, 94\u2013127 (2012)","journal-title":"Discrete & Computational Geometry"},{"key":"48_CR14","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 del Circolo Mathematico di Palermo\u00a022, 1\u201374 (1906)","journal-title":"Rendiconti del Circolo Mathematico di Palermo"},{"key":"48_CR15","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1137\/0214021","volume":"14","author":"E.M. McCreight","year":"1985","unstructured":"McCreight, E.M.: Priority search trees. SIAM Journal on Computing\u00a014, 257\u2013276 (1985)","journal-title":"SIAM Journal on Computing"},{"key":"48_CR16","unstructured":"Wenk, C.: Shape matching in higher dimensions, Dissertation, Freie Universit\u00e4t Berlin, Germany (2003)"},{"key":"48_CR17","unstructured":"Wenk, C., Salas, R., Pfoser, D.: Addressing the need for map-matching speed: Localizing global curve-matching algorithms. In: SSDBM, pp. 379\u2013388 (2006)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40450-4_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T16:50:46Z","timestamp":1558025446000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40450-4_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642404498","9783642404504"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40450-4_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}