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

Masafumi Yamashita; Hideki Umemoto; Ichiro Suzuki; Tsunehiko Kameda

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

Masafumi Yamashita, Hideki Umemoto, Ichiro Suzuki, Tsunehiko Kameda

Mathematical Informatics

Research output: Contribution to conference › Paper › peer-review

6 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 language	English
Pages	448-450
Number of pages	3
Publication status	Published - Jan 1 1997
Event	Proceedings of the 1997 13th Annual Symposium on Computational Geometry - Nice, Fr Duration: Jun 4 1997 → Jun 6 1997

Other

Other	Proceedings of the 1997 13th Annual Symposium on Computational Geometry
City	Nice, Fr
Period	6/4/97 → 6/6/97

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Geometry and Topology
Computational Mathematics

Cite this

@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 = jan,

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

T2 - Proceedings of the 1997 13th Annual Symposium on Computational Geometry

Y2 - 4 June 1997 through 6 June 1997

ER -

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

Abstract

Other

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this