Searching a polygonal region by a group of stationary k-searchers

Authors:
Masafumi Yamashita;Ichiro Suzuki;Tiko Kameda
Affiliations:
Department of Computer Science and Communication Engineering, Kyushu University, Hakozaki, Higashiku, Fukuoka 812-8581, Japan;Department of Electrical Engineering and Computer Science, University of Wisconsin-Milwaukee, Milwaukee, WI;School of Computing Science, Simon Fraser University, Burnaby, BC, V5A 1S6, Canada
Venue:
Information Processing Letters
Year:
2004

Citing 6
Cited 1

Art gallery theorems and algorithms

Art gallery theorems and algorithms
The searchlight scheduling problem

SIAM Journal on Computing
Searching for a mobile intruder in a polygonal region

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

Information Processing Letters
Visibility-based pursuit-evasion in a polygonal room with a door

SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
An algorithm for searching a polygonal region with a flashlight

Proceedings of the sixteenth annual symposium on Computational geometry

An annotated bibliography on guaranteed graph searching

Theoretical Computer Science

Quantified Score

Hi-index	0.90

Visualization

Abstract

We study the problem of searching for mobile intruders in a polygonal region by stationary searchers having various levels of vision given by the number of flashlights that a searcher carries. We show that (2g - 1) 1-searchers (i.e., 2g - 1 searchers with one flashlight each) are always sufficient, and sometimes necessary, to search a simple polygonal region having a guard number g, which is the size of a minimum guard set. We also show that g (h + 1)-searchers (i.e., g searchers with h + 1 flashlights each), and consequently g(h + 1) 1-searchers as well, can always search a polygonal region with h ≥ 1 holes having a guard number g.