For a polygonal region P with n vertices, a guard cover S is a set of points in P , such that any point in P can be seen from a point in S. In a colored guard cover, every element in a guard cover is assigned a color, such that no two guards with the same color have overlapping visibility regions. The Chromatic Art Gallery Problem (CAGP) asks for the minimum number of colors for which a colored...