{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T20:12:11Z","timestamp":1785010331709,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540388753","type":"print"},{"value":"9783540388760","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11841036_8","type":"book-chapter","created":{"date-parts":[[2006,9,11]],"date-time":"2006-09-11T13:20:54Z","timestamp":1157980854000},"page":"52-63","source":"Crossref","is-referenced-by-count":65,"title":["Fr\u00e9chet Distance for Curves, Revisited"],"prefix":"10.1007","author":[{"given":"Boris","family":"Aronov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sariel","family":"Har-Peled","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christian","family":"Knauer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yusu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carola","family":"Wenk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(00)00233-X","volume":"109","author":"O. Aichholzer","year":"2001","unstructured":"Aichholzer, O., Aurenhammer, F., Icking, C., Klein, R., Langetepe, E., Rote, G.: Generalized self-approaching curves. Discrete Applied Mathematics\u00a0109, 3\u201324 (2001)","journal-title":"Discrete Applied Mathematics"},{"key":"8_CR2","unstructured":"Alt, H., Buchin, M.: Semi-computability of the Fr\u00e9chet\u00a0distance between surfaces. In: Proc. 21th European Workshop on Computational Geometry (2005)"},{"key":"8_CR3","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, 262\u2013283 (2003)","journal-title":"J. Algorithms"},{"key":"8_CR4","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\u00a0distance between two polygonal curves. Internat. J. Comput. Geom. Appl.\u00a05, 75\u201391 (1995)","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Har-Peled, S., Mustafa, N., Wang, Y.: Near-linear time approximation algorithms for curve simplification in two and three dimensions. Algorithmica (to appear, 2005)","DOI":"10.1007\/s00453-005-1165-y"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Alt, H., Knauer, C., Wenk, C.: Matching polygonal curves with respect to the fr\u00e9chet distance. In: Proceedings 18th International Symposium on Theoretical Aspects of Computer Science, pp. 63\u201374 (2001)","DOI":"10.1007\/3-540-44693-1_6"},{"issue":"1","key":"8_CR7","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(1), 45\u201358 (2004)","journal-title":"Algorithmica"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1006\/jagm.1994.1038","volume":"17","author":"P.K. Agarwal","year":"1994","unstructured":"Agarwal, P.K., Sharir, M., Toledo, S.: Applications of parametric searching in geometric optimization. J. Algorithms\u00a017, 292\u2013318 (1994)","journal-title":"J. Algorithms"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Buchin, K., Buchin, M., Wenk, C.: Computing the Fr\u00e9chet\u00a0distance between simple polygons in polynomial time. In: Proc. 22st Annu. ACM Sympos. Comput. Geom., pp. 80\u201387 (2006)","DOI":"10.1145\/1137856.1137870"},{"key":"8_CR10","unstructured":"Brakatsoulas, S., Pfoser, D., Salas, R., Wenk, C.: On map-matching vehicle tracking data. In: Proc. 31st VLDB Conference, pp. 853\u2013864 (2005)"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF01840440","volume":"1","author":"B. Chazelle","year":"1986","unstructured":"Chazelle, B., Guibas, L.J.: Fractional cascading: I. A data structuring technique. Algorithmica\u00a01, 133\u2013162 (1986)","journal-title":"Algorithmica"},{"issue":"1","key":"8_CR12","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/200836.200853","volume":"42","author":"P.B. Callahan","year":"1995","unstructured":"Callahan, P.B., Kosaraju, S.R.: A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. J. ACM\u00a042(1), 67\u201390 (1995)","journal-title":"J. ACM"},{"key":"8_CR13","doi-asserted-by":"crossref","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\u00a0distance. Comput. Geom. Theory Appl.\u00a030, 113\u2013127 (2005)","journal-title":"Comput. Geom. Theory Appl."},{"key":"8_CR14","unstructured":"Efrat, A., Guibas, L.J., Har-Peled, S., Murali, T.M.: Morphing between polylines. In: Proc. 12th ACM-SIAM Sympos. Discrete Algorithms, pp. 680\u2013689 (2001)"},{"key":"8_CR15","unstructured":"Eiter, T., Mannila, H.: Computing discrete Fr\u00e9chet distance. Technical Report CD-TR 94\/64, Christian Doppler Laboratory for Expert Systems, TU Vienna, Austria (1994)"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Goldman, D., Istrail, S., Papadimitriou, C.H.: Algorithmic aspects of protein structure similarity. In: Proc. 40th Annu. IEEE Sympos. Found. Comput. Sci., pp. 512\u2013522 (1999)","DOI":"10.1109\/SFFCS.1999.814624"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Indyk, P.: Approximate nearest neighbor algorithms for Fr\u00e9chet distance via product metrics. In: Proc. 18th Annu. ACM Sympos. Comput. Geom., pp. 102\u2013106 (2002)","DOI":"10.1145\/513400.513414"},{"issue":"5","key":"8_CR18","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1142\/S0218001498000348","volume":"12","author":"S. Kwong","year":"1998","unstructured":"Kwong, S., He, Q.H., Man, K.F., Tang, K.S., Chau, C.W.: Parallel genetic-based hybrid pattern matching algorithm for isolated word recognition. Int. J. Pattern Recognition & Artificial Intelligence\u00a012(5), 573\u2013594 (1998)","journal-title":"Int. J. Pattern Recognition & Artificial Intelligence"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Kim, M.S., Kim, S.W., Shin, M.: Optimization of subsequence matching under time warping in time-series databases. In: Proc. ACM symp. Applied comput., pp. 581\u2013586 (2005)","DOI":"10.1145\/1066677.1066814"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Keogh, E.J., Pazzani, M.J.: Scaling up dynamic time warping to massive dataset. In: Proc. of the Third Euro. Conf. Princip. Data Mining and Know. Disc., London, UK, pp. 1\u201311 (1999)","DOI":"10.1007\/978-3-540-48247-5_1"},{"key":"8_CR21","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1002\/prot.340180405","volume":"18","author":"A. Kolinski","year":"1994","unstructured":"Kolinski, A., Skolnick, J.: Monte carlo simulations of protein folding: Lattice model and interaction scheme. Proteins\u00a018, 338\u2013352 (1994)","journal-title":"Proteins"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Lueker, G.S.: A data structure for orthogonal range queries. In: Proc. 19th Annu. IEEE Sympos. Found. Comput. Sci., pp. 28\u201334 (1978)","DOI":"10.1109\/SFCS.1978.1"},{"issue":"7","key":"8_CR23","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1109\/34.56215","volume":"12","author":"M. Parizeau","year":"1990","unstructured":"Parizeau, M., Plamondon, R.: A comparative analysis of regional correlation, dynamic time warping, and skeletal tree matching for signature verification. IEEE Trans. Pattern Anal. Mach. Intell.\u00a012(7), 710\u2013717 (1990)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"8_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0305004100071875","volume":"115","author":"G. Rote","year":"1994","unstructured":"Rote, G.: Curves with increasing chords. Math. Proc. Camb. Phil. Soc.\u00a0115, 1\u201312 (1994)","journal-title":"Math. Proc. Camb. Phil. Soc."},{"key":"8_CR25","unstructured":"Rote, G.: Computing the Fr\u00e9chet distance between piecewise smooth curves. Technical Report ECG-TR-241108-01 (May 2005)"},{"key":"8_CR26","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0020-0190(89)90166-X","volume":"30","author":"J.S. Salowe","year":"1989","unstructured":"Salowe, J.S.: L\n                           \u2009\u221e\u2009 interdistance selection by parametric search. Information Processing Letters\u00a030, 9\u201314 (1989)","journal-title":"Information Processing Letters"},{"key":"8_CR27","unstructured":"Wenk, C.: Shape Matching in Higher Dimensions. PhD thesis, Dept. of Comput. Sci., Freie Universit\u00e4t Berlin (2002)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11841036_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:17:01Z","timestamp":1619507821000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11841036_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540388753","9783540388760"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/11841036_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}