# Shortest Watchman Tours in Simple Polygons under Rotated Monotone Visibility

arXiv: https://arxiv.org/abs/2007.08368 · HTML: https://mlsanity.com/paper/2007.08368/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 16 Jul 2020.

## Built on by (most cited first, 1 of 1)

- [The Maximum Cover with Rotating Field of View](https://mlsanity.com/paper/2309.15573/) (2023)

## Abstract (arXiv)

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,180circ), 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.