Guarding Fat Polygons and Triangulating Guarded Polygons
نویسندگان
چکیده
In this paper we study three related problems: (i) Given a fat polygon P , we show how to find a set G of points in P such that every point on the boundary of P sees at least one point of G. The set G is said to guard the boundary of P and its cardinality depends on the shape parameters of P . Fat polygons are often used to model more realistic inputs. (ii) Given k points that guard the boundary of P , we show how to compute O(k) points that guard the interior of P . (iii) Given k points that guard P , we provide two simple O(kn) time algorithms to triangulate P : one that triangulates the polygon when the guards are given as input and the other slightly more complicated algorithm that triangulates the polygon when the guards are not given.
منابع مشابه
Triangulating and Guarding Realistic Polygons
We propose a new model of realistic input: k-guardable objects. An object is k-guardable if its boundary can be seen by k guards in the interior of the object. In this abstract, we describe a simple algorithm for triangulating k-guardable polygons. Our algorithm, which is easily implementable, takes linear time assuming that k is constant.
متن کاملOn k-Guarding of Polygons
A polygon is called k-guardable if it is possible to find a collection G of points in the interior of the edges of P such that every point in P is visible from at least k elements of G, and such that no edge of P contains more than one element of G. In this paper we prove that every simple polygon can be 1-guarded using at most n/2 guards, and that every polygon with 0 or 1 polygonal hole can...
متن کاملHidden Mobile Guards in Simple Polygons
We consider guarding classes of simple polygons using mobile guards (polygon edges and diagonals) under the constraint that no two guards may see each other. In contrast to most other art gallery problems, existence is the primary question: does a specific type of polygon admit some guard set? Types include simple polygons and the subclasses of orthogonal, monotone, and starshaped polygons. Add...
متن کاملOn Guarding Orthogonal Polygons with Bounded Treewidth
There exist many variants of guarding an orthogonal polygon in an orthogonal fashion: sometimes a guard can see an entire rectangle, or along a staircase, or along a orthogonal path with at most k bends. In this paper, we study all these guarding models in the special case of orthogonal polygons that have bounded treewidth in some sense. Exploiting algorithms for graphs of bounded treewidth, we...
متن کاملAltitude Terrain Guarding and Guarding Uni-Monotone Polygons
We show that the problem of guarding an x-monotone terrain from an altitude line and the problem of guarding a uni-monotone polygon are equivalent. We present a polynomial time algorithm for both problems, and show that the cardinality of a minimum guard set and the cardinality of a maximum witness set coincide. Thus, uni-monotone polygons are perfect; this result also extends to monotone mount...
متن کامل