Barrier Resilience of Visibility Polygons

Authors

  • Alexander Gilbers

Abstract

We consider the problem of computing the Barrier Resilience of a set of Visibility Polygons inside a 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 algorithms.

Downloads

How to Cite

Gilbers, A. . (2015). Barrier Resilience of Visibility Polygons. Informatica, 39(3). Retrieved from https://puffbird.ijs.si/index.php/informatica/article/view/977

Issue

Section

Special issue papers