DOI: 10.5176/2251-1911_CMCGS58
Authors: John Z. Zhang
Abstract: We revisit the walkability problem in a simple polygon by two guards. A walk is conducted by two guards on the polygon boundary. They both start at some same boundary point and walk on the boundary. It is required that the two guards maintain their mutual visibility at all times and eventually meet together again. A polygon may or may not be walkable, depending on where the two guards start their walk or no matter where they start on the boundary. In this work, we simplify the characterization of a walkable polygon by two guards in terms of visibility diagram, which captures the visibility information among boundary points of the polygon.
Keywords: polygon search; two-guard walk; visibility problelm; computational geometry
Updating...