Art Gallery Theorems and Approximation Algorithms
نویسندگان
چکیده
The art gallery problem is to determine the number of guards that are sufficient to cover or see every point in the interior of an art gallery. An art gallery can be viewed as a polygon P with or without holes with a total of n vertices and guards as points in P . Any point z ∈ P is said to be visible from a guard g if the line segment joining z and g does not intersect the exterior of P . Usually the guards may be placed anywhere inside P . If the guards are restricted to vertices of P , we call them vertex guards. If there is no restriction, the guards are referred as point guards. Point and vertex guards are also referred as stationary guards. If the guards are mobile, i.e., able to patrol along a segment inside P , they are called mobile guards. If the mobile guards are restricted to edges of P , they are called edge guards.
منابع مشابه
Art Gallery Theorems and Algorithms the International Series of Monographs on Computer Science Editors
متن کامل
The Inapproximability of Illuminating Polygons by α-Floodlights
We consider variants of the art gallery problem where guard visibility is limited to a certain angular aperture α. We show that the problem is NP-hard even when guards can be located in the interior of the polygon. We then proceed to prove that both this problem and its vertex variant, where guard placement is restricted to the vertices of the polygon, are APX-hard. We observe that earlier cons...
متن کاملArt Gallery and Illumination Problems
How many guards are necessary, and how many are sufficient to patrol the paintings and works of art in an art gallery with n walls? This wonderfully na¨ıve question of combinatorial geometry has, since its formulation, stimulated an increasing number of of papers and surveys. In 1987, J. O'Rourke published his book Art Gallery Theorems and Algorithms which has further fueled this area of resear...
متن کاملAn Approximation Algorithm For Point Guard Problem
In 1973, Victor Klee posed the following question: How many guards are necessary, and how many are sufficient to patrol the paintings and works of art in an art gallery with n walls? This resulted in many subsequent researches so that the various versions of the art gallery problem were posed. Most of the versions posed are NP-hard, so designing approximation algorithms becomes important. The b...
متن کاملConstant Approximation Algorithms for Guarding Simple Polygons using Vertex Guards
The art gallery problem enquires about the least number of guards sufficient to ensure that an art gallery, represented by a polygon P , is fully guarded. Most standard versions of this problem are known to be NP-hard. In 1987, Ghosh provided a deterministic O(log n)approximation algorithm for the case of vertex guards and edge guards in simple polygons. In the same paper, Ghosh also conjecture...
متن کامل