Art gallery problem

From Wikipedia, the free encyclopedia
  (Redirected from Art gallery theorem)
Jump to navigation Jump to search

The art gallery problem or museum problem is a well-studied visibility problem in computational geometry. It originates from a real-world problem of guarding an art gallery with the minimum number of guards who together can observe the whole gallery. In the geometric version of the problem, the layout of the art gallery is represented by a simple polygon and each guard is represented by a point in the polygon. A set of points is said to guard a polygon if, for every point in the polygon, there is some such that the line segment between and does not leave the polygon.

Two dimensions[edit]

Four cameras cover this gallery.

There are numerous variations of the original problem that are also referred to as the art gallery problem. In some versions guards are restricted to the perimeter, or even to the vertices of the polygon. Some versions require only the perimeter or a subset of the perimeter to be guarded.

Solving the version in which guards must be placed on vertices and only vertices need to be guarded is equivalent to solving the dominating set problem on the visibility graph of the polygon.

Chvátal's art gallery theorem[edit]

Chvátal's art gallery theorem, named after Václav Chvátal, gives an upper bound on the minimal number of guards. It states that guards are always sufficient and sometimes necessary to guard a simple polygon with vertices.

The question about how many vertices/watchmen/guards were needed was posed to Chvátal by Victor Klee in 1973.[1] Chvátal proved it shortly thereafter.[2] Chvátal's proof was later simplified by Steve Fisk,[3] via a 3-coloring argument.[4]

Fisk's short proof[edit]

A 3-coloring of the vertices of a triangulated polygon. The blue vertices form a set of three guards, as few as is guaranteed by the art gallery theorem. However, this set is not optimal: the same polygon can be guarded by only two guards.

Steve Fisk's proof [5] is so short and elegant that it was chosen for inclusion in Proofs from THE BOOK. The proof goes as follows:

First, the polygon is triangulated (without adding extra vertices). It is known that the vertices of the resulting triangulation graph may be 3-colored.[6] Clearly, under a 3-coloring, every triangle must have all three colors. The vertices with any one color form a valid guard set, because every triangle of the polygon is guarded by its vertex with that color. Since the three colors partition the n vertices of the polygon, the color with the fewest vertices defines a valid guard set with at most guards.


Chvátal's upper bound remains valid if the restriction to guards at corners is loosened to guards at any point not exterior to the polygon.

There are a number of other generalizations and specializations of the original art-gallery theorem.[7] For instance, for orthogonal polygons, those whose edges/walls meet at right angles, only guards are needed. There are at least three distinct proofs of this result, none of them simple: by Kahn, Klawe, and Kleitman; by Lubiw; and by Sack and Toussaint.[8]

A related problem asks for the number of guards to cover the exterior of an arbitrary polygon (the "Fortress Problem"): are sometimes necessary and always sufficient. In other words, the infinite exterior is more challenging to cover than the finite interior.[9]

Computational complexity[edit]

In decision problem versions of the art gallery problem, one is given as input both a polygon and a number k, and must determine whether the polygon can be guarded with k or fewer guards. This problem is -complete[10] and all of its standard variations (such as restricting the guard locations to vertices or edges of the polygon) are NP-hard.[11] Regarding approximation algorithms for the minimum number of guards, Eidenbenz, Stamm & Widmayer (2001) proved the problem to be APX-hard, implying that it is unlikely that any approximation ratio better than some fixed constant can be achieved by a polynomial time approximation algorithm. However, a constant approximation ratio is not known. Instead, a logarithmic approximation may be achieved for the minimum number of vertex guards by reducing the problem to a set cover problem.[12] As Valtr (1998) showed, the set system derived from an art gallery problem has bounded VC dimension, allowing the application of set cover algorithms based on ε-nets whose approximation ratio is the logarithm of the optimal number of guards rather than of the number of polygon vertices.[13] For unrestricted guards, the infinite number of potential guard positions makes the problem even more difficult. [14] However by restricting the guards to lie on a fine grid, a more complicated logarithmic approximation algorithm can be derived, under some mild extra assumptions. [15]

However, efficient algorithms are known for finding a set of at most vertex guards, matching Chvátal's upper bound. David Avis and Godfried Toussaint (1981) proved that a placement for these guards may be computed in O(n log n) time in the worst case, via a divide and conquer algorithm. Kooshesh & Moret (1992) gave a linear time algorithm by using Fisk's short proof and Bernard Chazelle's linear time plane triangulation algorithm.

An exact algorithm was proposed by Couto, de Rezende & de Souza (2011) for vertex guards. The authors conducted extensive computational experiments with several classes of polygons showing that optimal solutions can be found in relatively small computation times even for instances associated to thousands of vertices. The input data and the optimal solutions for these instances are available for download.[16]

Three dimensions[edit]

An example of a polyhedron with interior points not visible from any vertex.

If a museum is represented in three dimensions as a polyhedron, then putting a guard at each vertex will not ensure that all of the museum is under observation. Although all of the surface of the polyhedron would be surveyed, for some polyhedra there are points in the interior which might not be under surveillance.[17]

See also[edit]


  1. ^ O'Rourke (1987), p. 1.
  2. ^ Chvátal (1975).
  3. ^ Leghorn, Gemma (2010). "Mathematics professor dies of leukemia at 63". The Bowdoin Orient. 
  4. ^ Fisk (1978).
  5. ^ Fisk 1978.
  6. ^ To prove 3-colorability of polygon triangulations, we observe that the weak dual graph to the triangulation (the undirected graph having one vertex per triangle and one edge per pair of adjacent triangles) is a tree, since any cycle in the dual graph would form the boundary of a hole in the polygon, contrary to the assumption that it has no holes. Whenever there is more than one triangle, the dual graph (like any tree) must have a vertex with only one neighbor, corresponding to a triangle that is adjacent to other triangles along only one of its sides. The smaller polygon formed by removing this triangle has a 3-coloring by mathematical induction, and this coloring is easily extended to the one additional vertex of the removed triangle.[citation needed]
  7. ^ Shermer (1992).
  8. ^ O'Rourke (1987), pp.  31–80; Kahn, Klawe & Kleitman (1983); Lubiw (1985); Sack & Toussaint (1988).
  9. ^ O'Rourke (1987), pp. 146–154.
  10. ^ Abrahamsen, Mikkel; Adamaszek, Anna; Miltzow, Tillmann (2017), The Art Gallery Problem is -complete, arXiv:1704.06969Freely accessible, Bibcode:2017arXiv170406969A .
  11. ^ O'Rourke (1987), pp.  239–242; Aggarwal (1984); Lee & Lin (1986).
  12. ^ Ghosh (1987).
  13. ^ Brönnimann & Goodrich (1995).
  14. ^ Deshpande et al. (2007)
  15. ^ Bonnet, Edouard; Miltzow, Tillmann (2016), An Approximation Algorithm for the Art Gallery Problem, arXiv:1607.05527Freely accessible, Bibcode:2016arXiv160705527B .
  16. ^ Couto, de Rezende & de Souza (2011).
  17. ^ O'Rourke (1987), p. 255.