Bushiness and a Tight Worst-Case Upper Bound on the Search Number of a Simple Polygon

Abstract We show that 1 + ⌊ log 3 (2 b + 1)⌋ is a tight worst-case upper bound on the minimum number of searchers having 360° visibility needed to search a simple polygon with bushiness b .

[1]  Masafumi Yamashita,et al.  Searching for a Mobile Intruder in a Polygonal Region , 1992, SIAM J. Comput..

[2]  Masafumi Yamashita,et al.  Searching for a mobile intruder in a corridor: the open edge variant of the polygon search problem , 1995, Int. J. Comput. Geom. Appl..

[3]  Christos H. Papadimitriou,et al.  The complexity of searching a graph , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[4]  Leonidas J. Guibas,et al.  Finding an unpredictable target in a workspace with obstacles , 1997, Proceedings of International Conference on Robotics and Automation.

[5]  Reinhild Klein,et al.  Cholestatic liver diseases , 1993 .

[6]  Masafumi Yamashita,et al.  Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers , 2001, SCG '97.