{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:16:50Z","timestamp":1725484610280},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424932"},{"type":"electronic","value":"9783540446767"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44676-1_27","type":"book-chapter","created":{"date-parts":[[2007,5,18]],"date-time":"2007-05-18T12:43:15Z","timestamp":1179492195000},"page":"321-332","source":"Crossref","is-referenced-by-count":2,"title":["A Fast Algorithm for Approximating the Detour of a Polygonal Chain"],"prefix":"10.1007","author":[{"given":"Annette","family":"Ebbers-Baumann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Klein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elmar","family":"Langetepe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Lingas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,17]]},"reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(00)00233-X","volume":"109","author":"O. Aichholzer","year":"2001","unstructured":"O. Aichholzer, F. Aurenhammer, C. Icking, R. Klein, E. Langetepe, and G. Rote. Generalized self-approaching curves. Discrete Appl. Math., 109:3\u201324, 2001.","journal-title":"Discrete Appl. Math."},{"key":"27_CR2","unstructured":"H. Alt, C. Knauer, and C. Wenk. Bounding the Fr\u00e9chet distance by the Hausdorff distance. In Abstracts 17th European Workshop Comput. Geom., pages 166\u2013169. Freie Universit\u00e4t Berlin, 2001."},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0166-218X(95)00103-X","volume":"70","author":"R. E. Burkard","year":"1996","unstructured":"R. E. Burkard, B. Klinz, and R. Rudolf. Perspectives of Monge properties in optimization. Discrete Appl. Math., 70:95\u2013161, 1996.","journal-title":"Discrete Appl. Math."},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/B978-044482537-7\/50010-3","volume-title":"Handbook of Computational Geometry","author":"D. Eppstein","year":"2000","unstructured":"D. Eppstein. Spanning trees and spanners. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 425\u2013461. Elsevier Science Publishers B.V. North-Holland, Amsterdam, 2000."},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF01553883","volume":"4","author":"J. Hershberger","year":"1989","unstructured":"J. Hershberger. An optimal visibility graph algorithm for triangulated simple polygons. Algorithmica, 4:141\u2013155, 1989.","journal-title":"Algorithmica"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"C. Icking and R. Klein. Searching for the kernel of a polygon: A competitive strategy. In Proc. 11th Annu. ACM Sympos. Comput. Geom., pages 258\u2013266, 1995.","DOI":"10.1145\/220279.220307"},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1017\/S0305004198003016","volume":"125","author":"C. Icking","year":"1999","unstructured":"C. Icking, R. Klein, and E. Langetepe. Self-approaching curves. Math. Proc. Camb. Phil. Soc., 125:441\u2013453, 1999.","journal-title":"Math. Proc. Camb. Phil. Soc."},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF02187821","volume":"7","author":"J. M. Keil","year":"1992","unstructured":"J. M. Keil and C. A. Gutwin. Classes of graphs which approximate the complete Euclidean graph. Discrete Comput. Geom., 7:13\u201328, 1992.","journal-title":"Discrete Comput. Geom."},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"978","DOI":"10.1137\/S0097539799361671","volume":"30","author":"G. Narasimhan","year":"2000","unstructured":"G. Narasimhan and M. Smid. Approximating the stretch factor of Euclidean graphs. SIAM J. Comput., 30:978\u2013989, 2000.","journal-title":"SIAM J. Comput."},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0305004100071875","volume":"115","author":"G. Rote","year":"1994","unstructured":"G. Rote. Curves with increasing chords. Math. Proc. Camb. Phil. Soc., 115:1\u201312, 1994.","journal-title":"Math. Proc. Camb. Phil. Soc."},{"issue":"1","key":"27_CR11","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0925-7721(91)90012-4","volume":"1","author":"R. Seidel","year":"1991","unstructured":"R. Seidel. A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons. Comput. Geom. Theory Appl., 1(1):51\u201364, 1991.","journal-title":"Comput. Geom. Theory Appl."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44676-1_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T00:33:07Z","timestamp":1548289987000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44676-1_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424932","9783540446767"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-44676-1_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}