[ACM Press the 25th annual symposium - A
β
Couto, Marcelo C.; de Rezende, Pedro J.; de Souza, Cid C.
π
Article
π
2009
π
ACM Press
β 569 KB
The Art Gallery problem (agp) consists of minimizing the number of guards required to cover a gallery whose boundary is a simple polygon P . In this paper, we describe an Integer Programming based solution to agp that is presented in the accompanying video. Said solution is comprised of an exact alg