Problems of Posting Sentries: Variations on the Art Gallery Theorem

We examine the following problem and its variations: “Given a collection of mutually disjoint polygons (the objects) properly contained in a polygon (the enclosure), what is the minimum number of stationary guards that need to be posted within the enclosure but outside the objects so that every edge of each object is seen by some guard”.