Publication | Closed Access
The art gallery theorem for polygons with holes
85
Citations
5
References
2002
Year
Unknown Venue
EngineeringGeometryPlanar GraphEducationComputational ComplexityComplexity AnalysisDiscrete GeometryDiscrete MathematicsCombinatorial OptimizationComputational GeometryGeometric Graph TheoryCombinatorial ProblemComputer ScienceArt Gallery ProblemsArt Gallery TheoremGraph AlgorithmInteger ProgrammingGeometric AlgorithmGraph TheoryGallery Problem
Art gallery problems which have been extensively studied over the last decade ask how to station a small (minimum) set of guards in a polygon such that every point of the polygon is watched by at least one guard. The graph-theoretic formulation and solution to the gallery problem for polygons in standard form is given. A complexity analysis is carried out, and open problems are discussed.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
| Year | Citations | |
|---|---|---|
Page 1
Page 1