Searching and on-line recognition of star-shaped polygons

@article{LpezOrtiz2003SearchingAO,
  title={Searching and on-line recognition of star-shaped polygons},
  author={Alejandro L{\'o}pez-Ortiz and Sven Schuierer},
  journal={Inf. Comput.},
  year={2003},
  volume={185},
  pages={66-88}
}
We study the problem of on-line searching for a target inside a polygon. In particular, we propose a strategy for finding a target of unknown location in a star-shaped polygon with a competitive ratio of 11.52. We also provide a lower bound of 9 for the competitive ratio of searching in a star-shaped polygon which is close to the upper bound. A similar task is the on-line recognition of a star-shaped polygon P . Here, the robot travels on a path that allows it to decide whether P is star-shaped… CONTINUE READING