Sciweavers

ISAAC
1993
Springer
87views Algorithms» more  ISAAC 1993»
13 years 9 months ago
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 cal...
Svante Carlsson, Håkan Jonsson, Bengt J. Nil...