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 conferencePaper

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

Fingerprint

Simple Polygon
Polygon
Upper and Lower Bounds
Sufficient
Necessary

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Geometry and Topology
  • Computational Mathematics

Cite this

Yamashita, M., Umemoto, H., Suzuki, I., & Kameda, T. (1997). Searching for mobile intruders in a polygonal region by a group of mobile searchers. 448-450. Paper presented at Proceedings of the 1997 13th Annual Symposium on Computational Geometry, Nice, Fr, .

Searching for mobile intruders in a polygonal region by a group of mobile searchers. / Yamashita, Masafumi; Umemoto, Hideki; Suzuki, Ichiro; Kameda, Tsunehiko.

1997. 448-450 Paper presented at Proceedings of the 1997 13th Annual Symposium on Computational Geometry, Nice, Fr, .

Research output: Contribution to conferencePaper

Yamashita, M, Umemoto, H, Suzuki, I & Kameda, T 1997, 'Searching for mobile intruders in a polygonal region by a group of mobile searchers', Paper presented at Proceedings of the 1997 13th Annual Symposium on Computational Geometry, Nice, Fr, 6/4/97 - 6/6/97 pp. 448-450.
Yamashita M, Umemoto H, Suzuki I, Kameda T. Searching for mobile intruders in a polygonal region by a group of mobile searchers. 1997. Paper presented at Proceedings of the 1997 13th Annual Symposium on Computational Geometry, Nice, Fr, .
Yamashita, Masafumi ; Umemoto, Hideki ; Suzuki, Ichiro ; Kameda, Tsunehiko. / Searching for mobile intruders in a polygonal region by a group of mobile searchers. Paper presented at Proceedings of the 1997 13th Annual Symposium on Computational Geometry, Nice, Fr, .3 p.
@conference{c6e92d4293584461a5a7e103a9d18bed,
title = "Searching for mobile intruders in a polygonal region by a group of mobile searchers",
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.",
author = "Masafumi Yamashita and Hideki Umemoto and Ichiro Suzuki and Tsunehiko Kameda",
year = "1997",
month = "1",
day = "1",
language = "English",
pages = "448--450",
note = "Proceedings of the 1997 13th Annual Symposium on Computational Geometry ; Conference date: 04-06-1997 Through 06-06-1997",

}

TY - CONF

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

AU - Yamashita, Masafumi

AU - Umemoto, Hideki

AU - Suzuki, Ichiro

AU - Kameda, Tsunehiko

PY - 1997/1/1

Y1 - 1997/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0030672595&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030672595&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0030672595

SP - 448

EP - 450

ER -