Searching and on-line recognition of star-shaped polygons

Information and Computation

Volumn 185, Issue 1, 2003, Pages 66-88

  López Ortiz, Alejandro ^a   Schuierer, Sven ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF FREIBURG   (Germany)

Author keywords

Algorithmic foundations of robotics; Competitive ratio; Motion planning; On line searching; Star shaped polygons

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; COMPUTATIONAL GEOMETRY; COMPUTER SIMULATION; MOTION PLANNING; ONLINE SEARCHING; THEOREM PROVING;

COMPETITIVE RATIO; ONLINE RECOGNITION; STAR SHAPED POLYGONS;

COMPUTER VISION;

EID: 17744405082     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0890-5401(03)00081-6     Document Type: Article

References (23)

1. R. Baeza-Yates, J. Culberson, G. Rawlins, Searching in the plane. Information and Computation 106 (1993) 234-252.
2. P. Berman, A. Blum, A. Fiat, H. Karloff, A. Sacks, Randomized robot navigation algorithms, in Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms, 1996.
3. A. Blum, P. Raghavan, B. Schieber, Navigating in unfamiliar geometric terrain, in Proceedings of the 23rd ACM Symposium on Theory of Computing, 1991, pp. 494-504.
4. Ch. Bröcker, A. López-Ortiz, Position-independent street searching, in: F. Dehne, A. Gupta, J.-R, Sack, R. Tamassia (Eds.), Proceedings of the 6th International Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science, vol. 1663 Springer, Berlin 1999, pp. 241-252
5. Ch. Bröcker, S. Schuierer, Searching rectilinear streets completely, in F. Dehne, A. Gupta, J.-R. Sack, R. Tamassia (Eds.), Proceedings of the 6th International Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science, vol. 1663, Springer, Berlin, 1999, pp. 98-109.
6. A. Datta, Ch. Icking, Competitive searching in a generalized street, Proceedings of the 10th ACM Symposium on Computational Geometry, 1994, pp. 175-182.
7. S. Gal, Search Games, Academic Press, New York, 1980.
8. Ch. Icking, R. Klein, Searching for the kernel of a polygon, A Competitive strategy, in: Proceedings of the 11th ACM Symposium on Computational Geometry, 1995.
9. Ch. Icking, R. Klein, E. Langetepe, Searching for the kernel of a polygon: a competitive strategy using self-approaching curves, Technical Report 211, Department of Computer Science, Fern Universitát Hagen, Germany, 1997.
10. Ch. Icking, R. Klein, E. Langetepe, An optimal competitive strategy for walking in streets, in: Proceedings of the 16th Symposium on Theoretical Aspects of Computer Science, 1999.
11. Ch. Icking, R. Klein, Lihong, Ma. How to look around a corner, in: Proceedings of the 5th Canadian Conference on Computational Geometry, 1993, pp. 443-448.
12. M.-Y. Kao, J.H. Reif, S.R. Tate, Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem. in: Proceedings of the 4th ACM-SIAM Symposium on Discrete Algorithms, 1993, pp. 441-447.
13. R. Klein, Walking an unknown street with bounded detour, Computational Geometry: Theory and Applications 1 (1992) 325-351.
14. J. Kleinberg, On-line search in a simple polygon, in: Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms, 1994, pp. 8-15.
15. D.T. Lee, F.P. Preparata, An optimal algorithm for finding the kernel of a polygon. Journal of the ACM 26 (1979) 415-421.
16. J.-H. Lee, K.-Y. Chwa, Tight analysis of a self-approaching strategy for the online kernel-search problem. Information Processing Letters 69 (1) (1999) 39-45.
17. J.-H. Lee, C.-S. Shin, J.H. Kim, S.Y. Shin. New competitive strategies for searching in unknown star-shaped polygons, in: Proceedings of the 13th ACM Symposium Computational Geometry, 1997.
18. A. López-Ortiz, S. Schuierer, Generalized streets revisited, in: J. Diaz, M. Serna (Eds.), Proceedings of the 4th European Symposium on Algorithms, Lecture Notes in Computer Science, vol. 1136, Springer, Berlin, 1996, pp. 546-558.
19. A. López-Ortiz, S. Schuierer, Position-independent near optimal searching and on-line recognition in star polygons, in Proceedings of the 5th Workshop on Algorithms and Data Structures (WADS), Lecture Notes in Computer Science, 1997, pp. 284-296.
20. A. López-Ortiz, S. Schuierer, The ultimate strategy to search on m rays? in: W.-L, Hsa, M.-Y. Kao (Eds.), Proceedings of the 4th International Conference on Computing and Combinatorics, Lecture Notes in Computer Science, vol. 1449, 1998, pp. 75-84.
21. L. Palios, A new competitive strategy for reaching the kernel of an unknown polygon, in: M. Halldórsson (Ed.), Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science, vol. 1851, Springer, 2000, pp. 367-382.
22. F.P. Preparata, M.I. Shamos, Computational Geometry, Springer, New York, 1985.
23. S. Schuierer, I. Semrau. An optimal strategy for searching in unknown streets, in: Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, vol. 1563, Springer, 1999, pp. 121-131.