Approximate Guarding of Monotone and Rectilinear Polygons

DSpace Repository

Approximate Guarding of Monotone and Rectilinear Polygons

Details

Files for download Overview of item record
Publication Article, peer reviewed scientific
Title Approximate Guarding of Monotone and Rectilinear Polygons
Author Krohn, Erik A. ; Nilsson, Bengt J.
Date 2013
English abstract
We show that vertex guarding a monotone polygon is NP-hard and construct a constant factor approximation algorithm for interior guarding monotone polygons. Using this algorithm we obtain an approximation algorithm for interior guarding rectilinear polygons that has an approximation factor independent of the number of vertices of the polygon. If the size of the smallest interior guard cover is \OPT\ for a rectilinear polygon, our algorithm produces a guard set of size~$O(\OPT^2)$.
DOI https://doi.org/10.1007/s00453-012-9653-3 (link to publisher's fulltext.)
Publisher Springer
Host/Issue Algorithmica;3
Volume 66
ISSN 0178-4617
Pages 564-594
Language eng (iso)
Subject Computational geometry
Art gallery problems
Approximation algorithms
Sciences
Research Subject Categories::MATHEMATICS
Handle http://hdl.handle.net/2043/15471 Permalink to this page
Facebook

This item appears in the following Collection(s)

Details

Search


Browse

My Account

Statistics