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

Masafumi Yamashita, Ichiro Suzuki, Tiko Kameda

Research output: Contribution to journalArticlepeer-review

8 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)1-8
Number of pages8
JournalInformation Processing Letters
Issue number1
Publication statusPublished - Oct 16 2004

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications


Dive into the research topics of 'Searching a polygonal region by a group of stationary k-searchers'. Together they form a unique fingerprint.

Cite this