Abstract.
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(n 6 ) time, but it is adaptive, making it run faster on polygons with a simple structure.
Article PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received December 12, 1997, and in revised form September 30, 1998.
Rights and permissions
About this article
Cite this article
Carlsson, S., Jonsson, H. & Nilsson, B. Finding the Shortest Watchman Route in a Simple Polygon. Discrete Comput Geom 22, 377–402 (1999). https://doi.org/10.1007/PL00009467
Issue Date:
DOI: https://doi.org/10.1007/PL00009467