{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:22:03Z","timestamp":1760440923062},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157806"},{"type":"electronic","value":"9783642157813"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15781-3_6","type":"book-chapter","created":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T11:40:03Z","timestamp":1283341203000},"page":"63-74","source":"Crossref","is-referenced-by-count":9,"title":["Fr\u00e9chet Distance of Surfaces: Some Simple Hard Cases"],"prefix":"10.1007","author":[{"given":"Kevin","family":"Buchin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maike","family":"Buchin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Schulz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"6_CR1","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/s00454-009-9152-8","volume":"43","author":"H. Alt","year":"2010","unstructured":"Alt, H., Buchin, M.: Can we compute the similarity between surfaces? Discrete & Computational Geometry\u00a043(1), 78\u201399 (2010)","journal-title":"Discrete & Computational Geometry"},{"key":"6_CR2","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. Internat. J. Computational Geometry and Applications\u00a05, 75\u201391 (1995)","journal-title":"Internat. J. Computational Geometry and Applications"},{"issue":"2","key":"6_CR3","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/S0196-6774(03)00090-7","volume":"49","author":"S. Bespamyatnikh","year":"2003","unstructured":"Bespamyatnikh, S.: Computing homotopic shortest paths in the plane. J. Algorithms\u00a049(2), 284\u2013303 (2003)","journal-title":"J. Algorithms"},{"key":"6_CR4","unstructured":"Brakatsoulas, S., Pfoser, D., Salas, R., Wenk, C.: On map-matching vehicle tracking data. In: Proc. 31st Internat. Conf. Very Large Data Bases (VLDB), pp. 853\u2013864 (2005)"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1007\/978-3-540-92182-0_57","volume-title":"Algorithms and Computation","author":"K. Buchin","year":"2008","unstructured":"Buchin, K., Buchin, M., Gudmundsson, J., Luo, J., L\u00f6ffler, M.: Detecting commuting patterns by clustering subtrajectories. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 644\u2013655. Springer, Heidelberg (2008)"},{"issue":"1-2","key":"6_CR6","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/j.comgeo.2007.08.003","volume":"41","author":"K. Buchin","year":"2008","unstructured":"Buchin, K., Buchin, M., Wenk, C.: Computing the Fr\u00e9chet distance between simple polygons. Comput. Geom.: Theory and Applications\u00a041(1-2), 2\u201320 (2008)","journal-title":"Comput. Geom.: Theory and Applications"},{"key":"6_CR7","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. Internat. J. Geographical Information Science\u00a024, 1101\u20131125 (2010)","journal-title":"Internat. J. Geographical Information Science"},{"key":"#cr-split#-6_CR8.1","unstructured":"Chazal, F., Lieutier, A., Rossignac, J., Whited, B.: Ball-map: Homeomorphism between compatible surfaces. GVU Tech. Report GIT-GVU-06-05 (2005);"},{"key":"#cr-split#-6_CR8.2","unstructured":"To appear in the Internat. J. Comput. Geom. and Appl."},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Dey, T.K., Ranjan, P., Wang, Y.: Convergence, stability, and discrete approximation of Laplace spectra. In: Proc. 21st Annu. ACM-SIAM Sympos. Discr. Algorithms (SODA), pp. 650\u2013663 (2010)","DOI":"10.1137\/1.9781611973075.54"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/3-540-26808-1_9","volume-title":"Advances in Multiresolution for Geometric Modelling, Mathematics and Visualization","author":"M.S. Floater","year":"2005","unstructured":"Floater, M.S., Hormann, K.: Surface parameterization: a tutorial and survey. In: Dodgson, N.A., Floater, M.S., Sabin, M.A. (eds.) Advances in Multiresolution for Geometric Modelling, Mathematics and Visualization, pp. 157\u2013186. Springer, Berlin (2005)"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF03018603","volume":"22","author":"M. Fr\u00e9chet","year":"1906","unstructured":"Fr\u00e9chet, M.: Sur quelques points du calcul fonctionnel. Rendiconti Circ. Mat. Palermo\u00a022, 1\u201374 (1906)","journal-title":"Rendiconti Circ. Mat. Palermo"},{"key":"6_CR12","first-page":"4","volume":"3","author":"M. Fr\u00e9chet","year":"1924","unstructured":"Fr\u00e9chet, M.: Sur la distance de deux surfaces. Ann. Soc. Polonaise Math.\u00a03, 4\u201319 (1924)","journal-title":"Ann. Soc. Polonaise Math."},{"key":"6_CR13","unstructured":"Godau, M.: On the complexity of measuring the similarity between geometric objects in higher dimensions. PhD thesis, Freie Universit\u00e4t Berlin, Germany (1998)"},{"issue":"1","key":"6_CR14","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. Bioinformatics and Computational Biology\u00a06(1), 51\u201364 (2008)","journal-title":"J. Bioinformatics and Computational Biology"},{"key":"6_CR15","first-page":"216","volume-title":"Proc. 10th Annu. ACM Sympos. Theory of Computing","author":"T.J. Schaefer","year":"1978","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proc. 10th Annu. ACM Sympos. Theory of Computing, pp. 216\u2013226. ACM, New York (1978)"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Sriraghavendra, E., Karthik, K., Bhattacharyya, C.: Fr\u00e9chet distance based approach for searching online handwritten documents. In: Proc. 9th Int. Conf. Doc. Analy. Recog. (2007)","DOI":"10.1109\/ICDAR.2007.4378752"},{"key":"6_CR17","series-title":"CBMS-NSF Regional Conference Series in Applied Mathematics","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970265","volume-title":"Data Structures and Network Algorithms","author":"R.E. Tarjan","year":"1983","unstructured":"Tarjan, R.E.: Data Structures and Network Algorithms. CBMS-NSF Regional Conference Series in Applied Mathematics, vol.\u00a044. SIAM, Philadelphia (1983)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15781-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T22:28:27Z","timestamp":1559514507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15781-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157806","9783642157813"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15781-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}