Watchman route in a simple polygon with a rubberband algorithm
نویسندگان
چکیده
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(n log n), published in 2003 by M. Dror, A. Efrat, A. Lubiw, and J. Mitchell. – This paper provides an algorithm with κ(ε) · O(kn) runtime, where n is the number of vertices of the given simple polygon Π, and k the number of essential cuts; κ(ε) defines the numerical accuracy in dependency of a selected constant ε > 0. Moreover, our algorithm is significantly simpler, easier to understand and implement than previous ones for solving the fixed watchman route problem.
منابع مشابه
An Approximate Algorithm for Solving the Watchman Route Problem
The watchman route problem (WRP) was first introduced in 1988 and is defined as follows: How to calculate a shortest route completely contained inside a simple polygon such that any point inside this polygon is visible from at least one point on the route? So far the best known result for the WRP is an O(nlogn) runtime algorithm (with inherent numerical problems of its implementation). This pap...
متن کاملWatchman, Safari, and Zookeeper Routes in a Simple Polygon with Rubberband Algorithms
So far, the best result in running time for solving the “floating” watchman route problem (WRP) is O(n log n); the best result in running time for solving the “fixed” safari route problem (SRP) is O(n log n) published in 2003 by M. Dror, A. Efrat, A. Lubiw, and J. Mitchell. The best result in running time for solving the “floating” zookeeper route problem (ZRP) is O(n) published in 2001 by X. T...
متن کاملA Linear-time Algorithm for Orthogonal Watchman Route Problem with Minimum Bends
Given an orthogonal polygon P with n vertices, the goal of the watchman route problem is finding a path S of the minimum length in P such that every point of the polygon P is visible from at least one of the point of S. In the other words, in the watchman route problem we must compute a shortest watchman route inside a simple polygon of n vertices such that all the points interior to the polygo...
متن کاملFinding the Shortest Watchman Route in a Simple Polygon
We present the rst polynomial-time algorithm that nds 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 simple str...
متن کاملAn Approximation Algorithm for the Two-Watchman Route in a Simple Polygon
The two-watchman route problem is that of computing a pair of closed tours in an environment so that the two tours together see the whole environment and some length measure on the two tours is minimized. Two standard measures are: the minmax measure, where we want the tours where the longest of them has minimal length, and the minsum measure, where we want the tours for which the sum of their ...
متن کامل