Art Gallery Theorems and Algorithms is a mathematical monograph on topics related to the art gallery problem, on finding positions for guards within a polygonal museum floorplan so that all points of the museum are visible to at least one guard, and on related problems in computational geometry concerning polygons.
It was written by Joseph O'Rourke, and published in 1987 in the International Series of Monographs on Computer Science of the Oxford University Press.
[6] The art gallery problem, posed by Victor Klee in 1973, asks for the number of points at which to place guards inside a polygon (representing the floor plan of a museum) so that each point within the polygon is visible to at least one guard.
corners, but a simplified proof by Steve Fisk based on graph coloring and polygon triangulation is more widely known.
[4] Reviewer Herbert Edelsbrunner writes that "This book is the most comprehensive collection of results on polygons currently available and thus earns its place as a standard text in computational geometry.