Tight analysis of a self-approaching strategy for the online kernel-search problem

Information Processing Letters

Volumn 69, Issue 1, 1999, Pages 39-45

  Lee, Jae Ha ^a   Chwa, Kyung Yong ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Computational geometry; Online algorithm; Star shaped polygon

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; COMPUTER VISION; MOBILE ROBOTS;

ONLINE KERNEL SEARCH PROBLEM;

ONLINE SEARCHING;

EID: 0032804120     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00191-4     Document Type: Article

References (8)

1. F. Hoffmann, C. Icking, R. Klein, K. Kriegel, A competitive strategy for learning a polygon, in: Proc. 8th SODA, 1997, pp. 166-174.
2. C. Icking, R. Klein, Searching for the kernel of a polygon: A competitive strategy, in: Proc. 11th Annu. ACM Symp. Comp. Geom., 1995, pp. 258-266.
3. C. Icking, R. Klein, E. Langetepe, Searching for the kernel of a polygon: A competitive strategy using self-approaching strategy, Technical Report 211, Fern University Hagen, 1997.
4. C. Icking, R. Klein, E. Langetepe, Self-approaching curves, Math. Proc. Cambridge Philos. Soc., to appear.
5. R. Klein, Walking an unknown street with bounded detour, in: Proc. 32nd Annu. IEEE Symp. Found. Comput. Sci., 1991, pp. 304-313.
6. J.H. Lee, C.S. Shin, J.H. Kim, S.Y. Shin, K.Y. Chwa, New competitive strategies for searching in unknown star polygon, in: Proc. 13rd ACM Symp. Comp. Geom., 1997, pp. 427-429.
7. C.H. Papadimitriou, M. Yannakakis, Shortest paths without a map, in: Proc. 16th Internat. Colloq. Automata Lang. Program., Lecture Notes in Computer Sci., Vol. 372, Springer, Berlin, 1989, pp. 610-620.
8. G. Rote, Curves with increasing chords, Math. Proc. Cambridge Philos. Soc. 115 (1994) 1-12.