Barrier Resilience of Visibility Polygons
Polygon. We show that in simple polygons the problem is solvable in time linear in the number of edges.
In polygons with holes the problem is APX-hard, so only for special cases can we provide polynomial time
This work is licensed under a Creative Commons Attribution 3.0 License.