Skip to main navigation Skip to search Skip to main content

Locating guards for visibility coverage of polygons

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

20 Scopus citations

Abstract

We propose heuristics for visibility coverage of a polygon with the fewest point guards. This optimal coverage problem, often called the "art gallery problem", is known to be NP-hard, so most recent research has focused on heuristics and approximation methods. We evaluate our heuristics through experimentation, comparing the upper bounds on the optimal guard number given by our methods with computed lower bounds based on heuristics for placing a large number of visibility-independent "witness points". We give experimental evidence that our heuristics perform well in practice, on a large suite of input data; often the heuristics give a provably optimal result, while in other cases there is only a small gap between the computed upper and lower bounds on the optimal guard number.

Original languageEnglish
Title of host publicationProceedings of the 9th Workshop on Algorithm Engineering and Experiments and the 4th Workshop on Analytic Algorithms and Combinatorics
PublisherSociety for Industrial and Applied Mathematics Publications
Pages120-134
Number of pages15
ISBN (Print)0898716284, 9780898716283
DOIs
StatePublished - 2007
Event9th Workshop on Algorithm Engineering and Experiments and the 4th Workshop on Analytic Algorithms and Combinatorics - New Orleans, LA, United States
Duration: Jan 6 2007Jan 6 2007

Publication series

NameProceedings of the 9th Workshop on Algorithm Engineering and Experiments and the 4th Workshop on Analytic Algorithms and Combinatorics

Conference

Conference9th Workshop on Algorithm Engineering and Experiments and the 4th Workshop on Analytic Algorithms and Combinatorics
Country/TerritoryUnited States
CityNew Orleans, LA
Period01/6/0701/6/07

Fingerprint

Dive into the research topics of 'Locating guards for visibility coverage of polygons'. Together they form a unique fingerprint.

Cite this