{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:25:00Z","timestamp":1760441100749,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642330896"},{"type":"electronic","value":"9783642330902"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33090-2_21","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T15:29:11Z","timestamp":1346167751000},"page":"229-240","source":"Crossref","is-referenced-by-count":7,"title":["Locally Correct Fr\u00e9chet Matchings"],"prefix":"10.1007","author":[{"given":"Kevin","family":"Buchin","sequence":"first","affiliation":[]},{"given":"Maike","family":"Buchin","sequence":"additional","affiliation":[]},{"given":"Wouter","family":"Meulemans","sequence":"additional","affiliation":[]},{"given":"Bettina","family":"Speckmann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"21_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. of Comp. Geometry and Appl.\u00a05(1), 75\u201391 (1995)","journal-title":"Int. J. of Comp. Geometry and Appl."},{"issue":"7","key":"21_CR2","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. J. of GIS\u00a024(7), 1101\u20131125 (2010)","journal-title":"Int. J. of GIS"},{"issue":"3","key":"21_CR3","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. Int. J. of Comp. Geometry and Appl.\u00a021(3), 253\u2013282 (2011)","journal-title":"Int. J. of Comp. Geometry and Appl."},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Buchin, K., Buchin, M., Meulemans, W., Speckmann, B.: Locally correct Fre \u0301chet matchings. CoRR, abs\/1206.6257 (June 2012)","DOI":"10.1007\/978-3-642-33090-2_21"},{"issue":"4","key":"21_CR5","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/s00454-002-2886-1","volume":"28","author":"A. Efrat","year":"2002","unstructured":"Efrat, A., Guibas, L., Har-Peled, S., Mitchell, J., Murali, T.: New Similarity Measures between Polylines with Applications to Morphing and Polygon Sweeping. Discrete & Comp. Geometry\u00a028(4), 535\u2013569 (2002)","journal-title":"Discrete & Comp. Geometry"},{"key":"21_CR6","unstructured":"Eiter, T., Mannila, H.: Computing Discrete Fr\u00e9chet Distance. Technical Report CD-TR 94\/65, Christian Doppler Laboratory (1994)"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Har-Peled, S., Raichel, B.: Fre \u0301chet distance revisited and extended. CoRR, abs\/1202.5610 (February 2012)","DOI":"10.1145\/1998196.1998269"},{"issue":"2","key":"21_CR8","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., Shahbaz, K., Zarrabi-Zadeh, H.: Fr\u00e9chet distance with speed limits. Comp. Geometry: Theory and Appl.\u00a044(2), 110\u2013120 (2011)","journal-title":"Comp. Geometry: Theory and Appl."},{"key":"21_CR9","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, pp. 379\u2013388 (2006)","DOI":"10.1109\/SSDBM.2006.11"},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-642-30191-9_27","volume-title":"Bioinformatics Research and Applications","author":"T. Wylie","year":"2012","unstructured":"Wylie, T., Zhu, B.: A Polynomial Time Solution for Protein Chain Pair Simplification under the Discrete Fr\u00e9chet Distance. In: Bleris, L., M\u0103ndoiu, I., Schwartz, R., Wang, J. (eds.) ISBRA 2012. LNCS, vol.\u00a07292, pp. 287\u2013298. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33090-2_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T11:35:21Z","timestamp":1744025721000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33090-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642330896","9783642330902"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33090-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}