Generalized self-approaching curves

Discrete Applied Mathematics

Volumn 109, Issue 1-2, 2001, Pages 3-24

  Aichholzer, Oswin ^a   Aurenhammer, Franz ^a   Icking, Christian ^b   Klein, Rolf ^b   Langetepe, Elmar ^b   Rote, Günter ^c  

^a UNIVERSITY OF HAGEN   (Germany)

^b GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^c FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Arc length; Convex hull; Detour; Self approaching curves

Indexed keywords

EID: 0345978898     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00233-X     Document Type: Article

References (10)

1. H. Alt, B. Chazelle, R. Seidel (Eds.), Computational geometry, Dagstuhl-Seminar-Report 109, Internat. Begegnungs- und Forschungszentrum für Informatik, Schloss Dagstuhl, Germany, 1995.
2. 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-498.
3. Croft H.P., Falconer K.J., Guy R.K. Unsolved Problems in Geometry. 1990;Springer, Berlin.
4. 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-266.
5. Icking C., Klein R., Langetepe E. Self-approaching curves. Math. Proc. Cambridge Philos. Soc. 125:1999;441-453.
6. Lee J.-H., Chwa K.-Y. Tight analysis of a self-approaching strategy for the online kernel-search problem. Inform. Process. Lett. 69:1999;39-45.
7. 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-429.
8. A. López-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-447.
9. Rote G. Curves with increasing chords. Math. Proc. Cambridge Philos. Soc. 115:1994;1-12.
10. J. Ruppert, R. Seidel, Approximating the d -dimensional complete Euclidean graph, Proceedings of 3rd Canadian Conference on Computational Geometry, 1991, pp. 207-210.