Proceedings of the IEEE · 1992 · 292 citations · 77 references
ComputingMathematicsComputational ArtComputational GeometryGeometryGeometric ApproximationGeometric OptimizationIntersection DetectionLine Segment IntersectionVisibility ComputationComputational Geometry FoundationsMinimum Set ProblemPolygon GeometryPolygon TheoryVisibility In Polygonal Domains
Two points in a polygon are called if the straight line between them lies entirely inside the polygon. The art gallery problem for a polygon P is to find a minimum set of points G in P such that every point in P is visible from some point of G. The author provides an introduction to art gallery theorems and surveys the recent results of the field. The emphasis is on the results rather than the techniques. Several new problems that have the same geometric flavor as art gallery problems are also examined.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
77
Algorithms in Combinatorial Geometry.
Jacob E. Goodman, Herbert Edelsbrunner · American Mathematical Monthly · 1989 · 1.8K citations
Computational complexity of art gallery problems
D. Lee, A. Lin · IEEE Transactions on Information Theory · 1986 · 406 citations