12 search results - page 1 / 3 » Finding the Shortest Watchman Route in a Simple Polygon |
ISAAC
1993
Springer
13 years 9 months ago
1993
Springer
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...
CCCG
2010
13 years 6 months ago
2010
So far, the best result in running time for solving the fixed watchman route problem (i.e., shortest path for viewing any point in a simple polygon with given start point) is O(n3...
CCCG
2010
13 years 6 months ago
2010
A watchman tour in a polygonal domain (for short, polygon) is a closed curve such that every point in the polygon is visible from at least one point of the tour. The problem of fin...
CCCG
2006
13 years 6 months ago
2006
We study the relationship between the interior angles of a convex polygon and the lengths of external watchman routes.
CCCG
2010
13 years 6 months ago
2010
Assume that two points p and q are given and a finite ordered set of simple polygons, all in the same plane; the basic version of a touring-a-sequence-of-polygons problem (TPP) is...