{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T04:18:15Z","timestamp":1771561095421,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642237188","type":"print"},{"value":"9783642237195","type":"electronic"}],"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-23719-5_44","type":"book-chapter","created":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T09:14:33Z","timestamp":1314695673000},"page":"518-529","source":"Crossref","is-referenced-by-count":4,"title":["Improved Algorithms for Partial Curve Matching"],"prefix":"10.1007","author":[{"given":"Anil","family":"Maheshwari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rg-R\u00fcdiger","family":"Sack","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaveh","family":"Shahbaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hamid","family":"Zarrabi-Zadeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"44_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-03456-5_16","volume-title":"Efficient Algorithms: Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday","author":"H. Alt","year":"2009","unstructured":"Alt, H.: The computational geometry of comparing shapes. In: Efficient Algorithms: Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, pp. 235\u2013248. Springer, Heidelberg (2009)"},{"issue":"2","key":"44_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. J. Algorithms\u00a049(2), 262\u2013283 (2003)","journal-title":"J. Algorithms"},{"key":"44_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. J. of Comput. Geom. Appl.\u00a05, 75\u201391 (1995)","journal-title":"Int. J. of Comput. Geom. Appl."},{"issue":"7","key":"44_CR4","doi-asserted-by":"publisher","first-page":"1101","DOI":"10.1080\/13658810903569598","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 Geogr. Inform. Sci.\u00a024(7), 1101\u20131125 (2010)","journal-title":"Int. J. of Geogr. Inform. Sci."},{"key":"44_CR5","unstructured":"Buchin, K., Buchin, M., Knauer, C., Rote, G., Wenk, C.: How difficult is it to walk the dog? In: Proc. 23rd EWCG, pp. 170\u2013173 (2007)"},{"key":"44_CR6","doi-asserted-by":"crossref","unstructured":"Buchin, K., Buchin, M., Wang, Y.: Exact algorithms for partial curve matching via the Fr\u00e9chet distance. In: Proc. 20th ACM-SIAM Sympos. Discrete Algorithms, pp. 645\u2013654 (2009)","DOI":"10.1137\/1.9781611973068.71"},{"key":"44_CR7","unstructured":"Cook, A.F., Wenk, C.: Geodesic Fr\u00e9chet distance inside a simple polygon. In: Proc. 25th Sympos. Theoret. Aspects Comput. Sci. LNCS, vol.\u00a05664, pp. 193\u2013204 (2008)"},{"issue":"4","key":"44_CR8","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.J., Har-Peled, S., Mitchell, J.S.B., Murali, T.M.: New similarity measures between polylines with applications to morphing and polygon sweeping. Discrete Comput. Geom.\u00a028(4), 535\u2013569 (2002)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"44_CR9","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1142\/S0219720008003278","volume":"6","author":"M. Jiang","year":"2008","unstructured":"Jiang, M., Xu, Y., Zhu, B.: Protein structure-structure alignment with discrete Fr\u00e9chet distance. J. Bioinform. Comput. Biol.\u00a06(1), 51\u201364 (2008)","journal-title":"J. Bioinform. Comput. Biol."},{"issue":"2","key":"44_CR10","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."},{"key":"44_CR11","unstructured":"Maheshwari, A., Sack, J.-R., Shahbaz, K., Zarrabi-Zadeh, H.: Staying close to a curve. In: Proc. 23rd Canad. Conf. Computat. Geom. (to appear, 2011)"},{"key":"44_CR12","doi-asserted-by":"crossref","unstructured":"Sriraghavendra, E., Karthik, K., Bhattacharyya, C.: Fr\u00e9chet distance based approach for searching online handwritten documents. In: Proc. 9th Internat. Conf. Document Anal. Recognition, pp. 461\u2013465 (2007)","DOI":"10.1109\/ICDAR.2007.4378752"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23719-5_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T12:08:35Z","timestamp":1560514115000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23719-5_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237188","9783642237195"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23719-5_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}