摘要: We study the computational complexity of art gallery problem originally posed by Klee, and its variations. Specifically, determining minimum number vertex guards that can see an n -wall simply connected is shown to be NP-hard. The proof modified show problems edge point in a polygonal region are also As byproduct, decomposing simple polygon into star-shaped polygons such their union original