Barrier Resilience of Visibility Polygons

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.
Vol. 39, No.3

Authors

  • Alexander Gilbers

Downloads

How to Cite

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

Issue

Vol. 39 No. 3 (2015)

Section

Special issue papers

License

Authors retain copyright in their work. By submitting to and publishing with Informatica, authors grant the publisher (Slovene Society Informatika) the non-exclusive right to publish, reproduce, and distribute the article and to identify itself as the original publisher.

All articles are published under the Creative Commons Attribution license CC BY 3.0. Under this license, others may share and adapt the work for any purpose, provided appropriate credit is given and changes (if any) are indicated.

Authors may deposit and share the submitted version, accepted manuscript, and published version, provided the original publication in Informatica is properly cited.