Finding the Shortest Watchman Route in a Simple Polygon

We present the first polynomial time algorithm that finds the shortest route in a simple polygon such that all points of the polygon are visible from the route. This route is called the shortest watchman route, and we do not assume any restrictions on the route or on the simple polygon. Our algorithm runs in worst case O(n6 ) time, but it is adaptive, making it run faster on polygons with a simple structure.

• Type: Conference
• Year: 1993
• Where: ISAAC
• Authors: Svante Carlsson, Håkan Jonsson, Bengt J. Nilsson
• Keywords: Algorithms, ISAAC 1993, Shortest Watchman Route, Simple Polygon, first Polynomial Time