{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T11:51:22Z","timestamp":1673005882604},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2004,2,1]],"date-time":"2004-02-01T00:00:00Z","timestamp":1075593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3490,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[2004,2]]},"DOI":"10.1016\/s0925-7721(03)00046-4","type":"journal-article","created":{"date-parts":[[2003,9,16]],"date-time":"2003-09-16T21:31:23Z","timestamp":1063747883000},"page":"123-134","source":"Crossref","is-referenced-by-count":19,"title":["A fast algorithm for approximating the detour of a polygonal chain"],"prefix":"10.1016","volume":"27","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":"78","reference":[{"key":"10.1016\/S0925-7721(03)00046-4_BIB001","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0166-218X(00)00233-X","article-title":"Generalized self-approaching curves","volume":"109","author":"Aichholzer","year":"2001","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0925-7721(03)00046-4_BIB002","series-title":"Abstracts 17th European Workshop Comput. Geom.","first-page":"166","article-title":"Bounding the Fr\u00e9chet distance by the Hausdorff distance","author":"Alt","year":"2001"},{"key":"10.1016\/S0925-7721(03)00046-4_BIB003","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0166-218X(95)00103-X","article-title":"Perspectives of Monge properties in optimization","volume":"70","author":"Burkard","year":"1996","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0925-7721(03)00046-4_BIB004","series-title":"Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci.","first-page":"220","article-title":"Triangulating a simple polygon in linear time","author":"Chazelle","year":"1990"},{"key":"10.1016\/S0925-7721(03)00046-4_BIB005","series-title":"Handbook of Computational Geometry","first-page":"425","article-title":"Spanning trees and spanners","author":"Eppstein","year":"2000"},{"key":"10.1016\/S0925-7721(03)00046-4_BIB006","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF01553883","article-title":"An optimal visibility graph algorithm for triangulated simple polygons","volume":"4","author":"Hershberger","year":"1989","journal-title":"Algorithmica"},{"key":"10.1016\/S0925-7721(03)00046-4_BIB007","series-title":"Proc. 11th Annu. ACM Sympos. Comput. Geom.","first-page":"258","article-title":"Searching for the kernel of a polygon: A competitive strategy","author":"Icking","year":"1995"},{"key":"10.1016\/S0925-7721(03)00046-4_BIB008","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1017\/S0305004198003016","article-title":"Self-approaching curves","volume":"125","author":"Icking","year":"1999","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"10.1016\/S0925-7721(03)00046-4_BIB009","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF02187821","article-title":"Classes of graphs which approximate the complete Euclidean graph","volume":"7","author":"Keil","year":"1992","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(03)00046-4_BIB010","doi-asserted-by":"crossref","first-page":"978","DOI":"10.1137\/S0097539799361671","article-title":"Approximating the stretch factor of Euclidean graphs","volume":"30","author":"Narasimhan","year":"2000","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0925-7721(03)00046-4_BIB011","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0305004100071875","article-title":"Curves with increasing chords","volume":"115","author":"Rote","year":"1994","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"issue":"1","key":"10.1016\/S0925-7721(03)00046-4_BIB012","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0925-7721(91)90012-4","article-title":"A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons","volume":"1","author":"Seidel","year":"1991","journal-title":"Computational Geometry"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772103000464?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772103000464?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T09:30:25Z","timestamp":1551000625000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772103000464"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,2]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2004,2]]}},"alternative-id":["S0925772103000464"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(03)00046-4","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[2004,2]]}}}