{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T17:19:21Z","timestamp":1775063961601,"version":"3.50.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,2,20]],"date-time":"2013-02-20T00:00:00Z","timestamp":1361318400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1007\/s00453-013-9758-3","type":"journal-article","created":{"date-parts":[[2013,2,19]],"date-time":"2013-02-19T21:41:00Z","timestamp":1361310060000},"page":"641-657","source":"Crossref","is-referenced-by-count":6,"title":["Improved Algorithms for Partial Curve Matching"],"prefix":"10.1007","volume":"69","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","published-online":{"date-parts":[[2013,2,20]]},"reference":[{"key":"9758_CR1","doi-asserted-by":"crossref","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, Berlin (2009)"},{"issue":"2","key":"9758_CR2","doi-asserted-by":"crossref","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 49(2), 262\u2013283 (2003)","journal-title":"J. Algorithms"},{"key":"9758_CR3","doi-asserted-by":"crossref","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. Comput. Geom. Appl. 5, 75\u201391 (1995)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"7","key":"9758_CR4","doi-asserted-by":"crossref","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. Geogr. Inf. Sci. 24(7), 1101\u20131125 (2010)","journal-title":"Int. J. Geogr. Inf. Sci."},{"key":"9758_CR5","first-page":"170","volume-title":"Proceedings of the 23rd European Workshop on Computational Geometry","author":"K. Buchin","year":"2007","unstructured":"Buchin, K., Buchin, M., Knauer, C., Rote, G., Wenk, C.: How difficult is it to walk the dog? In: Proceedings of the 23rd European Workshop on Computational Geometry, pp. 170\u2013173 (2007)"},{"key":"9758_CR6","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1137\/1.9781611973068.71","volume-title":"Proceedings of the 20th ACM-SIAM Symposium on Discrete Algorithms","author":"K. Buchin","year":"2009","unstructured":"Buchin, K., Buchin, M., Wang, Y.: Exact algorithms for partial curve matching via the Fr\u00e9chet distance. In: Proceedings of the 20th ACM-SIAM Symposium on Discrete Algorithms, pp. 645\u2013654 (2009)"},{"issue":"1","key":"9758_CR7","first-page":"1","volume":"7","author":"A.F. Cook","year":"2010","unstructured":"Cook, A.F., Wenk, C.: Geodesic Fr\u00e9chet distance inside a simple polygon. ACM Trans. Algorithms 7(1), 1\u201319 (2010)","journal-title":"ACM Trans. Algorithms"},{"issue":"4","key":"9758_CR8","doi-asserted-by":"crossref","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. 28(4), 535\u2013569 (2002)","journal-title":"Discrete Comput. Geom."},{"key":"9758_CR9","first-page":"448","volume-title":"Proceedings of the 27th ACM Symposium on Computational Geometry","author":"S. Har-Peled","year":"2011","unstructured":"Har-Peled, S., Raichel, B.: The Fr\u00e9chet distance revisited and extended. In: Proceedings of the 27th ACM Symposium on Computational Geometry, pp. 448\u2013457 (2011)"},{"issue":"1","key":"9758_CR10","doi-asserted-by":"crossref","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.\u00a0Bioinform. Comput. Biol. 6(1), 51\u201364 (2008)","journal-title":"J.\u00a0Bioinform. Comput. Biol."},{"issue":"2","key":"9758_CR11","doi-asserted-by":"crossref","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. 44(2), 110\u2013120 (2011)","journal-title":"Comput. Geom."},{"key":"9758_CR12","first-page":"55","volume-title":"Proceedings of the 23rd Canadian Conference on Computational Geometry","author":"A. Maheshwari","year":"2011","unstructured":"Maheshwari, A., Sack, J.-R., Shahbaz, K., Zarrabi-Zadeh, H.: Staying close to a curve. In: Proceedings of the 23rd Canadian Conference on Computational Geometry, pp. 55\u201358 (2011)"},{"key":"9758_CR13","first-page":"461","volume-title":"Proceedings of the 9th International Conference on Document Analysis and Recognition","author":"E. Sriraghavendra","year":"2007","unstructured":"Sriraghavendra, E., Karthik, K., Bhattacharyya, C.: Fr\u00e9chet distance based approach for searching online handwritten documents. In: Proceedings of the 9th International Conference on Document Analysis and Recognition, pp. 461\u2013465 (2007)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9758-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-013-9758-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9758-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:11Z","timestamp":1559137511000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-013-9758-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,20]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["9758"],"URL":"https:\/\/doi.org\/10.1007\/s00453-013-9758-3","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,20]]}}}