APX-Hardness of the Minimum Vision Points Problem
Computational Geometry
2022-07-12 v1
Abstract
Placing a minimum number of guards on a given watchman route in a polygonal domain is called the {\em minimum vision points problem}. We prove that finding the minimum number of vision points on a shortest watchman route in a simple polygon is APX-Hard. We then extend the proof to the class of rectilinear polygons having at most three dent orientations.
Cite
@article{arxiv.2207.04488,
title = {APX-Hardness of the Minimum Vision Points Problem},
author = {Mayank Chaturvedi and Bengt J. Nilsson},
journal= {arXiv preprint arXiv:2207.04488},
year = {2022}
}
Comments
9 pages, 5 figures. A preliminary version was presented at the 38th European Workshop on Computational Geometry EuroCG 2022