Bushiness and a tight worst-case upper bound on the search number of a simple polygon

Information Processing Letters

Volumn 66, Issue 1, 1998, Pages 49-52

  Suzuki, Ichiro ^a   Yamashita, Masafumi ^b   Umemoto, Hideki ^c   Kameda, Tsunehiko ^d  

^a University of Wisconsin   (United States)

^b HIROSHIMA UNIVERSITY   (Japan)

^c ANRITSU CORPORATION   (Japan)

^d SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Bushiness; Computational geometry; Polygon search; Search number; Worst case bound

Indexed keywords

EID: 0012608390     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00029-5     Document Type: Article

References (6)

1. D. Crass, I. Suzuki, M. Yamashita, Searching for a mobile intruder in a corridor - The open edge variant of the polygon search problem, Internat. J. Comput. Geom. Appl. 5 (4) (1995) 397-412.
2. M. de Berg, R. Klein, Private communication, 1993.
3. S.M. LaValle, D. Lin, L.J. Guibas, J.-C. Latombe, R. Motwani, Finding an unpredictable target in a workspace with obstacles, in: Proc. IEEE International Conf. Robotics and Automation, 1997.
4. N. Megiddo, S.L. Hakimi, M.R. Garey, D.S. Johnson, C.H. Papadimitriou. The complexity of searching a graph. J. ACM 35 (1) (1988) 18-44.
5. I. Suzuki, M. Yamashita, Searching for a mobile intruder in a polygonal region, SIAM J. Comput. 21 (5) (1992) 868-888.
6. M. Yamashita, H. Umemoto, I. Suzuki, T. Kameda, Searching for mobile intruders in a polygonal region by a group of mobile searchers, in: Proc. 13th ACM Symp. Computational Geometry, 1997: full version available as: Technical Report TR-96-07-01, Department of Electrical Engineering and Computer Science, University of Wisconsin-Milwaukee.