Art gallery problem

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 S {displaystyle S} of points is said to guard a polygon if, for every point p {displaystyle p} in the polygon, there is some q ∈ S {displaystyle qin S} such that the line segment between p {displaystyle p} and q {displaystyle q} does not leave the polygon. 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 S {displaystyle S} of points is said to guard a polygon if, for every point p {displaystyle p} in the polygon, there is some q ∈ S {displaystyle qin S} such that the line segment between p {displaystyle p} and q {displaystyle q} does not leave the polygon.