Shortest watchman routes in simple polygons

Abstract

In this paper we present an O(n4, log log n) algorithm to find a shortest watchman route in a simple polygon through a point, s, in its boundary. A watchman route is a route such that each point in the interior of the polygon is visible from at least one point along the route. © 1991 Springer-Verlag New York Inc.