{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:12:17Z","timestamp":1742911937041,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642197536"},{"type":"electronic","value":"9783642197543"}],"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-19754-3_10","type":"book-chapter","created":{"date-parts":[[2011,3,28]],"date-time":"2011-03-28T09:22:38Z","timestamp":1301304158000},"page":"81-91","source":"Crossref","is-referenced-by-count":2,"title":["Go with the Flow: The Direction-Based Fr\u00e9chet Distance of Polygonal Curves"],"prefix":"10.1007","author":[{"given":"Mark","family":"de Berg","sequence":"first","affiliation":[]},{"suffix":"IV","given":"Atlas F.","family":"Cook","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_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. International Journal of Computational Geometry & Applications\u00a05, 75\u201391 (1995)","journal-title":"International Journal of Computational Geometry & Applications"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/3-540-44693-1_6","volume-title":"STACS 2001","author":"H. Alt","year":"2001","unstructured":"Alt, H., Knauer, C., Wenk, C.: Matching polygonal curves with respect to the Fr\u00e9chet distance. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol.\u00a02010, pp. 63\u201374. Springer, Heidelberg (2001)"},{"issue":"11","key":"10_CR3","doi-asserted-by":"publisher","first-page":"1512","DOI":"10.1109\/TKDE.2006.165","volume":"18","author":"T. Apaydin","year":"2006","unstructured":"Apaydin, T., Ferhatosmanoglu, H.: Access structures for angular similarity queries. IEEE Transactions on Knowledge and Data Engineering\u00a018(11), 1512\u20131525 (2006)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Arkin, E.M., Chew, L., Huttenlocher, D., Kedem, K., Mitchell, J.: An efficiently computable metric for comparing polygonal shapes. In: 1st Symposium on Discrete Algorithms (SODA), pp. 129\u2013137 (1990)","DOI":"10.21236\/ADA210105"},{"issue":"7","key":"10_CR5","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 Geographical Information Science\u00a024(7), 1101\u20131125 (2010)","journal-title":"Int. J. of Geographical Information Science"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Buchin, K., Buchin, M., Wang, Y.: Exact algorithms for partial curve matching via the Fr\u00e9chet distance. In: 20th Symposium on Discrete Algorithms (SODA), pp. 645\u2013654 (2009)","DOI":"10.1137\/1.9781611973068.71"},{"key":"10_CR7","unstructured":"Buchin, M.: On the computability of the Fr\u00e9chet distance between triangulated surfaces. Dissertation, Freie Universit\u00e4t Berlin (2007)"},{"key":"10_CR8","unstructured":"Cohen, S., Guibas, L.: Partial matching of planar polylines under similarity transformations. In: 8th Symposium on Discrete Algorithms (SODA), pp. 777\u2013786 (1997)"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Efrat, A., Fan, Q., Venkatasubramanian, S.: Curve matching, time warping, and light fields: New algorithms for computing similarity between curves. Journal of Mathematical Imaging and Vision (2007)","DOI":"10.1007\/s10851-006-0647-0"},{"key":"10_CR10","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. J. of Molecular Biology\u00a0346, 1173\u20131188 (2005)","journal-title":"J. of Molecular Biology"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/11759966_65","volume-title":"Advances in Neural Networks - ISNN 2006","author":"H. Li","year":"2006","unstructured":"Li, H., Shen, I.: Similarity measure for vector field learning. In: Wang, J., et al. (eds.) ISNN 2006. LNCS, vol.\u00a03971, pp. 436\u2013441. Springer, Heidelberg (2006)"},{"key":"10_CR12","unstructured":"Maheshwari, A., Sack, J.R., Shahbaz, K.: Computing Fr\u00e9chet distance with speed limits. In: 21st Canadian Conf. on Computational Geometry (CCCG), pp. 107\u2013110 (2009)"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Veltkamp, R.C.: Shape matching: Similarity measures and algorithms. Shape Modeling and Applications, 188\u2013197 (2001)","DOI":"10.1109\/SMA.2001.923389"},{"key":"10_CR14","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","Theory and Practice of Algorithms in (Computer) Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19754-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T18:25:32Z","timestamp":1741112732000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19754-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642197536","9783642197543"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19754-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}