{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:05:18Z","timestamp":1760439918954},"reference-count":10,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,4,1]],"date-time":"2001-04-01T00:00:00Z","timestamp":986083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4490,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2001,4]]},"DOI":"10.1016\/s0166-218x(00)00233-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T18:17:26Z","timestamp":1027621046000},"page":"3-24","source":"Crossref","is-referenced-by-count":20,"title":["Generalized self-approaching curves"],"prefix":"10.1016","volume":"109","author":[{"given":"Oswin","family":"Aichholzer","sequence":"first","affiliation":[]},{"given":"Franz","family":"Aurenhammer","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Icking","sequence":"additional","affiliation":[]},{"given":"Rolf","family":"Klein","sequence":"additional","affiliation":[]},{"given":"Elmar","family":"Langetepe","sequence":"additional","affiliation":[]},{"given":"G\u00fcnter","family":"Rote","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00233-X_BIB1","unstructured":"H. Alt, B. Chazelle, R. Seidel (Eds.), Computational geometry, Dagstuhl-Seminar-Report 109, Internat. Begegnungs- und Forschungszentrum f\u00fcr Informatik, Schloss Dagstuhl, Germany, 1995."},{"key":"10.1016\/S0166-218X(00)00233-X_BIB2","doi-asserted-by":"crossref","unstructured":"S. Arya, G. Das, D.M. Mount, J.S. Salowe, M. Smid, Euclidean spanners: short, thin, and lanky, Proceedings of 27th Annual ACM Symposium on Theory Comput., 1995, pp. 489\u2013498.","DOI":"10.1145\/225058.225191"},{"year":"1990","series-title":"Unsolved Problems in Geometry","author":"Croft","key":"10.1016\/S0166-218X(00)00233-X_BIB3"},{"key":"10.1016\/S0166-218X(00)00233-X_BIB4","doi-asserted-by":"crossref","unstructured":"C. Icking, R. Klein, Searching for the kernel of a polygon: a competitive strategy, Proceedings of 11th Annual ACM Symposium on Computational Geometry, 1995, pp. 258\u2013266.","DOI":"10.1145\/220279.220307"},{"key":"10.1016\/S0166-218X(00)00233-X_BIB5","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\/S0166-218X(00)00233-X_BIB6","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0020-0190(98)00191-4","article-title":"Tight analysis of a self-approaching strategy for the online kernel-search problem","volume":"69","author":"Lee","year":"1999","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(00)00233-X_BIB7","doi-asserted-by":"crossref","unstructured":"J.-H. Lee, C.-S. Shin, J.-H. Kim, S.Y. Shin, K.-Y. Chwa, New competitive strategies for searching in unknown star-shaped polygons, Proceedings of 13th Annual ACM Symposium Computational Geometry, 1997, pp. 427\u2013429.","DOI":"10.1145\/262839.263062"},{"key":"10.1016\/S0166-218X(00)00233-X_BIB8","doi-asserted-by":"crossref","unstructured":"A. L\u00f3pez-Ortiz, S. Schuierer, Position-independent near optimal searching and on-line recognition in star polygons, Proceedings of 13th Annual ACM Symposium Computational Geometry, 1997, pp. 445\u2013447.","DOI":"10.1145\/262839.263077"},{"key":"10.1016\/S0166-218X(00)00233-X_BIB9","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."},{"key":"10.1016\/S0166-218X(00)00233-X_BIB10","unstructured":"J. Ruppert, R. Seidel, Approximating the d-dimensional complete Euclidean graph, Proceedings of 3rd Canadian Conference on Computational Geometry, 1991, pp. 207\u2013210."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X0000233X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X0000233X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T00:22:47Z","timestamp":1556065367000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X0000233X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,4]]},"references-count":10,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,4]]}},"alternative-id":["S0166218X0000233X"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00233-x","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2001,4]]}}}