Shortest Watchman Tours in Simple Polygons under Rotated Monotone Visibility

07/16/2020
by   Bengt J. Nilsson, et al.
0

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 θ, while θ varies in [0,180^∘), obtaining the directions for the tour to be the shortest one over all tours, where n is the number of vertices, r is the number of reflex vertices, and G≤ r is the maximum number of gates of the polygon used at any time in the algorithm.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset