Abstract
In this paper, we consider the variant of the art gallery problem where the input polygon is a staircase polygon. Previous works on this problem gave a 2-approximation for point guarding a staircase polygon (where guards can be placed anywhere in the interior of the polygon and we wish to guard the entire polygon). It is still unknown whether this point guarding variant is NP-hard. In this paper we consider the vertex guarding problem, where guards are only allowed to be placed at the vertices of the polygon, and we wish to guard only the vertices of the polygon. We show that this problem is NP-hard, and we give a polynomial-time 2-approximation algorithm.
Cite
CITATION STYLE
Gibson-Lopez, M., Krohn, E., Nilsson, B. J., Rayford, M., Soderman, S., & Żyliński, P. (2022). On Vertex Guarding Staircase Polygons. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 13568 LNCS, pp. 746–760). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-20624-5_45
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
