APX-Hardness of the Minimum Vision Points Problem

Mayank Chaturvedi, Bengt J. Nilsson

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 vi…