The Complexity of Guarding Monotone Polygons

DSpace Repository

The Complexity of Guarding Monotone Polygons

Show full item record

Files for download

article
Facebook

Simple item record

Publication Conference Paper, peer reviewed
Title The Complexity of Guarding Monotone Polygons
Author(s) Krohn, Erik ; Nilsson, Bengt J.
Date 2012
English abstract
A polygon P is x-monotone if any line orthogonal to the x-axis has a simply connected intersection with P. A set G of points inside P or on the boundary of P is said to guard the polygon if every point inside P or on the boundary of P is seen by a point in G. An interior guard can lie anywhere inside or on the boundary of the polygon. Using a reduction from Monotone 3SAT, we prove that the decision version of this problem is NP-hard. Because interior guards can be placed anywhere inside the polygon, a clever gadget is introduced that forces interior guards to be placed at very specific locations.
Link http://2012.cccg.ca/e-proceedings.pdf (external link to publication)
Host/Issue 24th Canadian Conference on Computational Geometry, August 8-10, 2012 Charlottetown, Canada;
Pages 167-172
Language eng (iso)
Subject(s) Computational Geometry
Visibility
Monotone Polygons
NP-hardness
Complexity
Sciences
Research Subject Categories::MATHEMATICS
Note 24th Canadian Conference on Computational Geometry, Charlottetown, Prince Edward Island, Canada, August 8-10, 2012
Handle http://hdl.handle.net/2043/18452 (link to this page)
Link http://2012.cccg.ca/ (external link to related web page)

This item appears in the following Collection(s)

Show full item record

Search


Browse

My Account

Statistics