Shortest Watchman Tours in Simple Polygons under Rotated Monotone Visibility

Bengt J. Nilsson, David Orden, Leonidas Palios +2

We present an $O(nrG)$ time algorithm for computing and maintaining a minimum length shortest watchman tour that sees a simple polygon under monotone visibility in direction $\theta$, w…