Computer Science and Information Technology Vol. 3(6), pp. 233 - 246
DOI: 10.13189/csit.2015.030602
Reprint (PDF) (298Kb)

A Unified Framework for Two-guard Walk Problem

John Z. Zhang
Mathematics and Computer Science, University of Lethbridge, Lethbridge, AB T1K 3M4, Canada

ABSTRACT

We propose a unified framework to study the walk problem in a polygonal area by two collaborative guards. A walk is conducted by the two mobile guards on the area's boundary. They start at an initial boundary point, move along the boundary, and may possibly meet together again at an ending boundary point. It is required that the two guards maintain their mutual visibility at all times. Depending the geometric properties of the polygonal area, a walk may or may not be possible. In this work, three versions of the problem, namely, general polygon walk, room walk and street walk, are characterized in a unified manner in our framework. One additional merit of our framework is its simplicity. Applications of the walk problem by two guards include military rescue, area exploration, art gallery surveillance, etc.

KEYWORDS
Visibility in Polygons, Two-guard Walk, Streets and Rooms, Visibility Diagram, Computational Geometry

Cite This Paper in IEEE or APA Citation Styles
(a). IEEE Format:
[1] John Z. Zhang , "A Unified Framework for Two-guard Walk Problem," Computer Science and Information Technology, Vol. 3, No. 6, pp. 233 - 246, 2015. DOI: 10.13189/csit.2015.030602.

(b). APA Format:
John Z. Zhang (2015). A Unified Framework for Two-guard Walk Problem. Computer Science and Information Technology, 3(6), 233 - 246. DOI: 10.13189/csit.2015.030602.