The
Art Gallery Problem
(AGP) is a classic problem in computational geometry, introduced in 1973 by Victor Klee. Given a simple polygon 풫 and an integer
k
, the goal is to decide if there exists a set
G
of
k
guards
within 풫 such that every point
p
∈ 풫 is seen by at least one guard
g
∈
G
. Each guard corresponds to a point in the polygon 풫, and we say that a guard
g
sees
a point
p
if the line segment
pg
is contained in 풫.
We prove that the AGP is ∃ ℝ-complete, implying that (1) any system of polynomial equations over the real numbers can be encoded as an instance of the AGP, and (2) the AGP is not in the complexity class NP unless NP = ∃ ℝ. As a corollary of our construction, we prove that for any real algebraic number α, there is an instance of the AGP where one of the coordinates of the guards equals α in any guard set of minimum cardinality. That rules out many natural geometric approaches to the problem, as it shows that any approach based on constructing a finite set of candidate points for placing guards has to include points with coordinates being roots of polynomials with arbitrary degree. As an illustration of our techniques, we show that for every compact semi-algebraic set
S
⊆ [0, 1]
2
, there exists a polygon with corners at rational coordinates such that for every
p
∈ [0, 1]
2
, there is a set of guards of minimum cardinality containing
p
if and only if
p
∈
S
.
In the ∃ ℝ-hardness proof for the AGP, we introduce a new ∃ ℝ-complete problem ETR-INV. We believe that this problem is of independent interest, as it has already been used to obtain ∃ ℝ-hardness proofs for other problems.
An Exact and Efficient Algorithm for the Orthogonal Art Gallery Problem
