Searching for mobile intruders in a polygonal region by a group of mobile searchers

Masafumi Yamashita, Hideki Umemoto, Ichiro Suzuki, Tsunehiko Kameda

Research output: Contribution to conferencePaperpeer-review

14 Citations (Scopus)

Abstract

The problem of finding mobile intruders in a simple polygon using as few searchers as possible is considered. The polygon search number represents the number of searchers necessary and sufficient to search the simple polygon. The upper and lower bounds on the polygon search number of this simple polygon in terms of four measures of shape complexity are presented. The gap between the upper and lower bounds are given in terms of measures that are at most one for all values, whereas those given in terms of bushiness match. These bounds are either tight or almost tight.

Original languageEnglish
Pages448-450
Number of pages3
Publication statusPublished - Jan 1 1997
EventProceedings of the 1997 13th Annual Symposium on Computational Geometry - Nice, Fr
Duration: Jun 4 1997Jun 6 1997

Other

OtherProceedings of the 1997 13th Annual Symposium on Computational Geometry
CityNice, Fr
Period6/4/976/6/97

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Geometry and Topology
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Searching for mobile intruders in a polygonal region by a group of mobile searchers'. Together they form a unique fingerprint.

Cite this