We study the problem of finding optimal covers of polygonal regions using multiple mobile guards. By our definition, a point is covered if, at some time, it lies within the convex hull of the guards from which it is visible. The definition captures our desire that guards both “see” and “surround” points that they cover. Guards move along continuous timeparameterized curves within a polygonal re...
