On the Complexity of Half-Guarding Monotone Polygons
Computational Geometry
2022-04-29 v1
Abstract
We consider a variant of the art gallery problem where all guards are limited to seeing to the right inside a monotone polygon. We call such guards: half-guards. We provide a polynomial-time approximation for point guarding the entire monotone polygon. We improve the best known approximation of 40 from [11], to 8. We also provide an NP-hardness reduction for point guarding a monotone polygon with half-guards.
Cite
@article{arxiv.2204.13143,
title = {On the Complexity of Half-Guarding Monotone Polygons},
author = {Hannah Miller Hillberg and Erik Krohn and Alex Pahlow},
journal= {arXiv preprint arXiv:2204.13143},
year = {2022}
}
Comments
15 pages, 19 figures, preliminary version appeared in EuroCG 2021