12 search results - page 1 / 3 » Watchman route in a simple polygon with a rubberband algorit... |
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...
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...
CAIP
2005
Springer
13 years 10 months ago
2005
Springer
We consider simple cube-curves in the orthogonal 3D grid. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded set. The c...
CCCG
2007
13 years 6 months ago
2007
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
IWCIA
2004
Springer
13 years 10 months ago
2004
Springer
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...