{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:13:19Z","timestamp":1725516799484},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540697329"},{"type":"electronic","value":"9783540697336"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69733-6_35","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"352-362","source":"Crossref","is-referenced-by-count":2,"title":["Voronoi Diagram of Polygonal Chains under the Discrete Fr\u00e9chet Distance"],"prefix":"10.1007","author":[{"given":"Sergey","family":"Bereg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kevin","family":"Buchin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maike","family":"Buchin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marina","family":"Gavrilova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Binhai","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"publisher","first-page":"1714","DOI":"10.1137\/S0097539794265724","volume":"26","author":"P. Agarwal","year":"1997","unstructured":"Agarwal, P., Aronov, B., Sharir, M.: Computing Envelopes in Four Dimensions with Applications. SIAM J. Comput.\u00a026, 1714\u20131732 (1997)","journal-title":"SIAM J. Comput."},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Alt, H., Godau, M.: Measuring the Resemblance of Polygonal Curves. In: Proceedings of the 8th Annual Symposium on Computational Geometry (SoCG 1992), pp. 102\u2013109 (1992)","DOI":"10.1145\/142675.142699"},{"key":"35_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. Intl. J. Computational Geometry and Applications\u00a05, 75\u201391 (1995)","journal-title":"Intl. J. Computational Geometry and Applications"},{"key":"35_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)"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Buchin, K., Buchin, M., Wenk, C.: Computing the Fr\u00e9chet Distance between Simple Polygons in Polynomial Time. In: Proceedings of the 22nd Annual Symposium on Computational Geometry (SoCG 2006), pp. 80\u201387 (2006)","DOI":"10.1145\/1137856.1137870"},{"key":"35_CR6","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF02187681","volume":"1","author":"H. Edelsbrunner","year":"1986","unstructured":"Edelsbrunner, H., Seidel, R.: Voronoi Diagrams and Arrangements. Discrete Comput. Geom.\u00a01, 25\u201344 (1986)","journal-title":"Discrete Comput. Geom."},{"key":"35_CR7","unstructured":"Eiter, T., Mannila, H.: Computing Discrete Fr\u00e9chet Distance. Tech. Report CD-TR 94\/64, Information Systems Department, Technical University of Vienna (1994)"},{"key":"35_CR8","doi-asserted-by":"crossref","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 del Circolo Mathematico di Palermo\u00a022, 1\u201374 (1906)","journal-title":"Rendiconti del Circolo Mathematico di Palermo"},{"key":"35_CR9","unstructured":"Godau, M.: On the Complexity of Measuring the Similarity between Geometric Objects in Higher Dimensions. PhD thesis, Freie Universit\u00e4t, Berlin (1998)"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Indyk, P.: Approximate Nearest Neighbor Algorithms for Fr\u00e9chet Distance via Product Metrics. In: Proceedings of the 18th Annual Symposium on Computational Geometry (SoCG 2002), pp. 102\u2013106 (2002)","DOI":"10.1145\/513400.513414"},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"Jiang, M., Xu, Y., Zhu, B.: Protein Structure-structure Alignment with Discrete Fr\u00e9chet Distance. In: Proceedings of the 5th Asia-Pacific Bioinformatics Conference (APBC 2007), pp. 131\u2013141 (2007)","DOI":"10.1142\/9781860947995_0016"},{"key":"35_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"F.P. Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, Heidelberg (1985)"},{"key":"35_CR13","unstructured":"Schaudt, B., Drysdale, S.: Higher Dimensional Delaunay Diagrams for Convex Distance Functions. In: Proceedings of the 4th Canadian Conference on Computational Geometry (CCCG 1992), pp. 274\u2013279 (1992)"},{"key":"35_CR14","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/BF02574384","volume":"12","author":"M. Sharir","year":"1994","unstructured":"Sharir, M.: Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions. Discrete Comp. Geom.\u00a012, 327\u2013345 (1994)","journal-title":"Discrete Comp. Geom."},{"key":"35_CR15","unstructured":"Wenk, C.: Shape Matching in Higher Dimensions. PhD thesis, Freie Universit\u00e4t, Berlin (2002)"},{"issue":"10","key":"35_CR16","doi-asserted-by":"publisher","first-page":"1343","DOI":"10.1089\/cmb.2007.0156","volume":"14","author":"B. Zhu","year":"2007","unstructured":"Zhu, B.: Protein Local Structure Alignment under the Discrete Fr\u00e9chet Distance. J. Computational Biology\u00a014(10), 1343\u20131351 (2007)","journal-title":"J. Computational Biology"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69733-6_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:02:16Z","timestamp":1605762136000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69733-6_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540697329","9783540697336"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69733-6_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}