Approximating Watchman Routes
Joseph S. B. Mitchell · 2013
Given a connected polygonal domain P, the watchman route problem is to compute a shortest path or tour for a mobile guard (the “watchman”) that is required to see every point of P. While the watchman route problem is polynomially solvable in simple polygons, it is known to be NP-hard in polygons with holes.