KNOWPIA
WELCOME TO KNOWPIA

* 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.

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. Václav Chvátal provided the first proof that the answer is at most for a polygon with corners, but a simplified proof by Steve Fisk based on graph coloring and polygon triangulation is more widely known. This is the opening material of the book,^{[3]} which goes on to covers topics including visibility, decompositions of polygons, coverings of polygons, triangulations and triangulation algorithms, and higher-dimensional generalizations,^{[1]} including the result that some polyhedra such as the Schönhardt polyhedron do not have triangulations without additional vertices.^{[1]}^{[4]} More generally, the book has as a theme "the interplay between discrete and computational geometry".^{[3]}

It has 10 chapters, whose topics include the original art gallery theorem and Fisk's triangulation-based proof; rectilinear polygons; guards that can patrol a line segment rather than a single point; special classes of polygons including star-shaped polygons, spiral polygons, and monotone polygons; non-simple polygons; prison yard problems, in which the guards must view the exterior, or both the interior and exterior, of a polygon; visibility graphs; visibility algorithms; the computational complexity of minimizing the number of guards; and three-dimensional generalizations.^{[2]}^{[3]}

The book only requires an undergraduate-level knowledge of graph theory and algorithms.^{[2]} However, it lacks exercises, and is organized more as a monograph than as a textbook.^{[5]} Despite warning that it omits some details that would be important to implementors of the algorithms that it describes, and does not describe algorithms that perform well on random inputs despite poor worst-case complexity, reviewer Wm. Randolph Franklin recommends it "for the library of every geometer".^{[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. It is very well written and a pleasure to read."^{[1]} However, reviewer Patrick J. Ryan complains that some of the book's proofs are inelegant,^{[5]} and reviewer David Avis, writing in 1990, noted that already by that time there were "many new developments" making the book outdated. Nevertheless, Avis writes that "the book succeeds on a number of levels", as an introductory text for undergraduates or for researchers in other areas, and as an invitation to solve the "many unsolved questions" remaining in this area.^{[3]}

- ^
^{a}^{b}^{c}^{d}Edelsbrunner, Herbert (1989), "Review of*Art Gallery Theorems and Algorithms*",*Mathematical Reviews*, MR 0921437 - ^
^{a}^{b}^{c}Vlach, M., "Review of*Art Gallery Theorems and Algorithms*",*zbMATH*, Zbl 0653.52001 - ^
^{a}^{b}^{c}^{d}^{e}Avis, David (1990), "Review of*Art Gallery Theorems and Algorithms*",*American Mathematical Society*, New Series,**23**(1): 230–234, doi:10.1090/S0273-0979-1990-15939-7, MR 1567872 - ^
^{a}^{b}^{c}Franklin, Wm. Randolph (June 1989), "Review of*Art Gallery Theorems and Algorithms*",*SIAM Review*,**31**(2): 342–343, doi:10.1137/1031076 - ^
^{a}^{b}^{c}Ryan, Patrick J. (September 1987), "Review of*Art Gallery Theorems and Algorithms*",*ACM Computing Reviews*, ISBN 978-0-19-503965-8 **^**O'Rourke, Joseph,*Art Gallery Theorems and Algorithms*, Smith College, retrieved 2020-02-20