{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:10:13Z","timestamp":1742962213103,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642255908"},{"type":"electronic","value":"9783642255915"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-25591-5_26","type":"book-chapter","created":{"date-parts":[[2011,12,3]],"date-time":"2011-12-03T00:32:34Z","timestamp":1322872354000},"page":"240-249","source":"Crossref","is-referenced-by-count":1,"title":["Fast Fr\u00e9chet Queries"],"prefix":"10.1007","author":[{"given":"Mark","family":"de Berg","sequence":"first","affiliation":[]},{"suffix":"IV","given":"Atlas F.","family":"Cook","sequence":"additional","affiliation":[]},{"given":"Joachim","family":"Gudmundsson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","unstructured":"Agrawal, R., Lin, K.-I., Sawhney, H.S., Shim, K.: Fast similarity search in the presence of noise, scaling, and translation in time-series databases. In: 21st International Conference on Very Large Data Bases, pp. 490\u2013501 (1995)"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Alt, H., Behrends, B., Blomer, J.: Approximate matching of polygonal shapes. Annals of Mathematics and Artificial Intelligence\u00a0(3-4), 251\u2013265 (1995)","DOI":"10.1007\/BF01530830"},{"key":"26_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. Int. Journal of Computational Geometry & Applications\u00a05, 75\u201391 (1995)","journal-title":"Int. Journal of Computational Geometry & Applications"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Alt, H., Guibas, L.: Discrete geometric shapes: Matching, interpolation, and approximation. In: Handbook of Comp. Geom., pp. 121\u2013153. Elsevier (1999)","DOI":"10.1016\/B978-044482537-7\/50004-8"},{"issue":"2","key":"26_CR5","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s00453-003-1042-5","volume":"38","author":"H. Alt","year":"2004","unstructured":"Alt, H., Knauer, C., Wenk, C.: Comparison of distance measures for planar curves. Algorithmica\u00a038(2), 45\u201358 (2004)","journal-title":"Algorithmica"},{"key":"26_CR6","unstructured":"Amisco, http:\/\/www.sport-universal.com"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Aronov, B., Har-Peled, S., Knauer, C., Wang, Y., Wenk, C.: Frechet distances for curves, revisited. In: European Symposium on Algorithms, pp. 52\u201363 (2006)","DOI":"10.1007\/11841036_8"},{"issue":"1","key":"26_CR8","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0020-0190(97)00140-3","volume":"64","author":"E. Belogay","year":"1997","unstructured":"Belogay, E., Cabrelli, C., Molter, U., Shonkwiler, R.: Calculating the Hausdorff distance between curves. Information Processing Letters\u00a064(1), 17\u201322 (1997)","journal-title":"Information Processing Letters"},{"issue":"7","key":"26_CR9","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. Int. Journal of GIS\u00a024(7), 1101\u20131125 (2010)","journal-title":"Int. Journal of GIS"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Buchin, K., Buchin, M., Wang, Y.: Exact algorithms for partial curve matching via the Fr\u00e9chet distance. In: 20th Symp. on Discrete Algorithm, pp. 645\u2013654 (2009)","DOI":"10.1137\/1.9781611973068.71"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Chan, T.M.: Optimal partition trees. In: 26th Symposium on Computational Geometry (SoCG), New York, NY, USA, pp. 1\u201310 (2010)","DOI":"10.1145\/1810959.1810961"},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.comgeo.2004.05.004","volume":"30","author":"M. Clausen","year":"2005","unstructured":"Clausen, M., Mosig, A.: Approximately matching polygonal curves with respect to the Fr\u00e9chet distance. Comp. Geom. \u2013 Theory & Appl.\u00a030, 113\u2013127 (2005)","journal-title":"Comp. Geom. \u2013 Theory & Appl."},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Driemel, A., Har-Peled, S., Wenk, C.: Approximating the Fr\u00e9chet distance for realistic curves in near linear time. 26th Symp. on Comp. Geom., SoCG (2010)","DOI":"10.1145\/1810959.1811019"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Kalpakis, K., Gada, D., Puttagunta, V.: Distance measures for effective clustering of arima timeseries. In: 1st IEEE Int. Conf. on Data Mining, pp. 273\u2013280 (2001)","DOI":"10.1109\/ICDM.2001.989529"},{"key":"26_CR15","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.1016\/j.jmb.2004.12.032","volume":"346","author":"R. Kolodny","year":"2005","unstructured":"Kolodny, R., Koehl, P., Levitt, M.: Comprehensive evaluation of protein structure alignment: Scoring by geometric measures. Journal of Molecular Biology\u00a0346, 1173\u20131188 (2005)","journal-title":"Journal of Molecular Biology"},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"Lee, J.-G., Han, J., Whang, K.-Y.: Trajectory clustering: a partition-and-group framework. In: ACM SIGMOD International Conference on Management of Data, pp. 593\u2013604 (2007)","DOI":"10.1145\/1247480.1247546"},{"key":"26_CR17","unstructured":"Gunopulos, D., Vlachos, M., Kollios, G.: Discovering similar multidimensional trajectories. In: 18th Int. Conf. on Data Engineering, pp. 673\u2013684 (2002)"},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"Wenk, C., Salas, R., Pfoser, D.: Addressing the need for map-matching speed: Localizing global curve-matching algorithms. In: 18th Conference on Scientific and Statistical Database Management (SSDBM), pp. 379\u2013388 (2006)","DOI":"10.1109\/SSDBM.2006.11"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25591-5_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,14]],"date-time":"2025-03-14T19:32:06Z","timestamp":1741980726000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25591-5_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642255908","9783642255915"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25591-5_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}