An efficient algorithm for guard placement in polygons with holes

Abstract

In this paper we consider the problem of placing guards to supervise an art gallery with holes. No gallery with n vertices and h holes requires more than [(n+h)/3] guards. For some galleries this number of guards is necessary. We present an algorithm which places the [(n+h)/3] guards in O(n2) time. © 1995 Springer-Verlag New York Inc.