The visibility region of points in a simple polygon.
Otfried Cheong, René van Oostrum · Canadian Conference on Computational Geometry · 1999
Let R be a polygonal region with h polygonal holes and n vertices in total, and let P be a set of m point guards in the interior of R. We show that the region of all points in R visible from at least one guard in P has at most n+ 2mn+ 4 h+2 2 m 2 vertices and can be computed in time O(((m(h+ 1))2 +mn logm) log(m+n)).