The Complexity of Guarding Monotone Polygons

DSpace Repository

The Complexity of Guarding Monotone Polygons

Overview

Detailed record

dc.contributor.author Krohn, Erik
dc.contributor.author Nilsson, Bengt J.
dc.date.accessioned 2015-01-09T14:14:19Z
dc.date.available 2015-01-09T14:14:19Z
dc.date.issued 2012 en_US
dc.identifier.citation 167-172 en_US
dc.identifier.uri http://hdl.handle.net/2043/18452
dc.description.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. en_US
dc.language.iso eng en_US
dc.subject Computational Geometry en_US
dc.subject Visibility en_US
dc.subject Monotone Polygons en_US
dc.subject NP-hardness en_US
dc.subject Complexity en_US
dc.subject.classification Sciences en_US
dc.title The Complexity of Guarding Monotone Polygons en_US
dc.type Conference Paper, peer reviewed en_US
dc.relation.url http://2012.cccg.ca/ en_US
dc.contributor.department Malmö University. Faculty of Technology and Society
dc.description.other 24th Canadian Conference on Computational Geometry, Charlottetown, Prince Edward Island, Canada, August 8-10, 2012 en_US
dc.subject.srsc Research Subject Categories::MATHEMATICS en_US
dc.identifier.url http://2012.cccg.ca/e-proceedings.pdf
dc.relation.ispartofpublication 24th Canadian Conference on Computational Geometry, August 8-10, 2012 Charlottetown, Canada;
 Find Full text Files for download

This item appears in the following Collection(s)

Overview

Search


Browse

My Account

Statistics