Name
Abstract | ||
|---|---|---|
We consider the problem of searching for mobile intruders in a polygonal region with one door by two guards. Given a simple polygon P with a door d, which is called a room (P, d), two guards start at d and walk along the boundary of P to detect a mobile intruder with a laser beam between the two guards. During the walk, two guards are required to be mutually visible all the time and eventually meet at one point. We give a characterization of the class of rooms searchable by two guards and an O (n log n)-time algorithm to test if a given room admits a walk, where n is the number of the vertices in P. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1142/S021819590200092X | INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS |
Keywords | DocType | Volume |
visibility, motion planning, two guards, room | Journal | 12 |
Issue | ISSN | Citations |
4 | 0218-1959 | 6 |
PageRank | References | Authors |
0.58 | 7 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sang-Min Park | 1 | 223 | 21.45 |
| Jae-Ha Lee | 2 | 144 | 14.19 |
| Kyung-Yong Chwa | 3 | 919 | 97.10 |