{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T04:45:35Z","timestamp":1776401135820,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642175138","type":"print"},{"value":"9783642175145","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17514-5_36","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T20:09:23Z","timestamp":1291406963000},"page":"422-433","source":"Crossref","is-referenced-by-count":5,"title":["Computing the Discrete Fr\u00e9chet Distance with Imprecise Input"],"prefix":"10.1007","author":[{"given":"Hee-Kap","family":"Ahn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Knauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Scherfenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lena","family":"Schlipf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antoine","family":"Vigneron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"36_CR1","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1145\/299917.299918","volume":"30","author":"P.K. Agarwal","year":"1998","unstructured":"Agarwal, P.K., Sharir, M.: Efficient algorithms for geometric optimization. Computing Surveys\u00a030(4), 412\u2013458 (1998)","journal-title":"Computing Surveys"},{"issue":"3","key":"36_CR2","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(3), 292\u2013318 (1994)","journal-title":"J. Algorithms"},{"key":"36_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. International Journal of Computational Geometry and Applications\u00a05, 75\u201391 (1995)","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"36_CR4","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":"1","key":"36_CR5","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s00453-003-1042-5","volume":"38","author":"H. Alt","year":"2003","unstructured":"Alt, H., Knauer, C., Wenk, C.: Comparison of distance measures for planar curves. Algorithmica\u00a038(1), 45\u201358 (2003)","journal-title":"Algorithmica"},{"key":"36_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/11841036_8","volume-title":"Algorithms \u2013 ESA 2006","author":"B. Aronov","year":"2006","unstructured":"Aronov, B., Har-Peled, S., Knauer, C., Wang, Y., Wenk, C.: Fr\u00e9chet distance for curves, revisited. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 52\u201363. Springer, Heidelberg (2006)"},{"key":"36_CR7","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1145\/142675.142681","volume-title":"Proc. 8th Symposium on Computational Geometry","author":"M.E. Dyer","year":"1992","unstructured":"Dyer, M.E.: A class of convex programs with applications to computational geometry. In: Proc. 8th Symposium on Computational Geometry, pp. 9\u201315. ACM, New York (1992)"},{"key":"36_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511530067","volume-title":"Geometry and Topology for Mesh Generation","author":"H. Edelsbrunner","year":"2001","unstructured":"Edelsbrunner, H.: Geometry and Topology for Mesh Generation. Cambridge University Press, Cambridge (2001)"},{"key":"36_CR9","unstructured":"Eiter, T., Mannila, H.: Computing discrete Fr\u00e9chet distance. Tech. Rep. CD-TR 94\/64, Christian Doppler Laboratory for Expert Systems, TU Vienna, Austria (1994)"},{"issue":"1","key":"36_CR10","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1137\/0213002","volume":"13","author":"G.N. Frederickson","year":"1984","unstructured":"Frederickson, G.N., Johnson, D.B.: Generalized selection and ranking: Sorted matrices. SIAM Journal on Computing\u00a013(1), 14\u201330 (1984)","journal-title":"SIAM Journal on Computing"},{"key":"36_CR11","unstructured":"Khanban, A.A., Edalat, A.: Computing Delaunay triangulation with imprecise input data. In: Proc. 15th Canadian Conference on Computational Geometry, pp. 94\u201397 (2003)"},{"key":"36_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1007\/978-3-642-10631-6_73","volume-title":"ISAAC","author":"C. Knauer","year":"2009","unstructured":"Knauer, C., L\u00f6ffler, M., Scherfenberg, M., Wolle, T.: The directed Hausdorff distance between imprecise point sets. In: ISAAC. LNCS, vol.\u00a05878, pp. 720\u2013729. Springer, Heidelberg (2009)"},{"key":"36_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/11785293_35","volume-title":"Algorithm Theory \u2013 SWAT 2006","author":"M. L\u00f6ffler","year":"2006","unstructured":"L\u00f6ffler, M., van Kreveld, M.J.: Largest and smallest tours and convex hulls for imprecise points. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol.\u00a04059, pp. 375\u2013387. Springer, Heidelberg (2006)"},{"issue":"3","key":"36_CR14","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.comgeo.2008.12.007","volume":"43","author":"M. L\u00f6ffler","year":"2010","unstructured":"L\u00f6ffler, M., Snoeyink, J.: Delaunay triangulation of imprecise points in linear time after preprocessing. Computational Geometry: Theory and Applications\u00a043(3), 234\u2013242 (2010)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"36_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0935-6","volume-title":"Compression and Coding Algorithms","author":"A. Moffat","year":"2002","unstructured":"Moffat, A., Turpin, A.: Compression and Coding Algorithms. Kluwer, Dordrecht (2002)"},{"issue":"3","key":"36_CR16","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.comgeo.2005.01.004","volume":"37","author":"G. Rote","year":"2007","unstructured":"Rote, G.: Computing the Fr\u00e9chet distance between piecewise smooth curves. Computational Geometry: Theory and Applications\u00a037(3), 162\u2013174 (2007)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"36_CR17","unstructured":"Sember, J., Evans, W.: Guaranteed Voronoi diagrams of uncertain sites. In: Proc. 20th Annual Canadian Conference on Computational Geometry (2008)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17514-5_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,4]],"date-time":"2023-06-04T10:46:00Z","timestamp":1685875560000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17514-5_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175138","9783642175145"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17514-5_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}