  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.
