Minimum Covers for Grids and Orthogonal Polygons by Periscope Guards
Abstract
The problem of finding minimum guard covers in NP-hard for simple polygons and open for simple orthogonal polygons. Alternative definitions of visibility have been considered for orthogonal polygons. In this paper we try to determine the complexity of finding guard covers in orthogonal polygons by considering periscope visibility. Under periscope visibility two points in an orthogonal polygon are visible if there is an orthogonal path with at most one bend that connects them without intersecting the exterior of the polygon. Periscope visibility is the closest to standard visibility among various alternatives that have been proposed. We show that finding minimum periscope guard (as well as k-bend and s-guard) covers is NP-hard for 3-d grids. An O(n- cubed) algorithm for finding minimum periscope guard covers is presented in a simple grid with n segments. This result can be used to obtain minimum periscope guard covers for a class of simple orthogonal polygon in O(n-cubed).
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 04, 1990
- Accession Number
- ADA225443
Entities
People
- Laxmi Gewali
- Simeon Ntafos
Organizations
- University of Nevada, Las Vegas