Title :
Recent results in art galleries [geometry]
Author :
Shermer, Thomas C.
Author_Institution :
Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC, Canada
fDate :
9/1/1992 12:00:00 AM
Abstract :
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
Keywords :
computational geometry; art galleries; art gallery problem; art gallery theorems; geometric flavor; geometry; minimum set of points; polygon; Acceleration; Art; Computational geometry; Councils; Subspace constraints;
Journal_Title :
Proceedings of the IEEE
