We decomposed a simple polygon into many small regions. Then we estimated a visibility polygon of a point by a subset of the small regions. Now I need the minimum set of visibility polygons that can cover all the small regions, the whole polygon. This can be seen as an instance of the Set Cover problem. However, I need an easier approach. As we deal with visibility polygons inside a simple polygon there must be an easier way than a general instance of the Set Cover problem.