Answers are grounded in this paper and cite their sources.
We prove that the art gallery problem is equivalent under polynomial time reductions to deciding whether a system of polynomial equations over the real numbers has a solution. The art gallery problem is a classic problem in computational geometry, introduced in 1973 by Victor Klee. Given a simple polygon P and an integer k, the goal is to decide if there exists a set G of k guards within P such that every point p ∈ P is seen by at least one guard g∈ G. Each guard corresponds to a point in the polygon P, and we say that a guard g sees a point p if the line segment pg is contained in P.
No takes yet. Share an insight, caveat, or question.
Abrahamsen et al. (2018) studied this question.
Synapse has enriched 6 closely related papers on similar clinical questions. Consider them for comparative context: