• Title: Art Gallery Theorems and Algorithms
• Author(s) Joseph O'Rourke
• Publisher: Oxford University Press, USA (October 1, 1987)
• Hardcover: 304 pages
• eBook: PDF Files and a Single PDF (296 pages, 12 MB)
• Language: English
• ISBN-10: 0195039653
• ISBN-13: 978-0195039658
• Share This:  

Book Description

Art gallery theorems and algorithms are so called because they relate to problems involving the visibility of geometrical shapes and their internal surfaces. This book explores generalizations and specializations in these areas. Among the presentations are recently discovered theorems on orthogonal polygons, polygons with holes, exterior visibility, visibility graphs, and visibility in three dimensions. The author formulates many open problems and offers several conjectures, providing arguments which may be followed by anyone familiar with basic graph theory and algorithms. This work may be applied to robotics and artificial intelligence as well as other fields, and will be especially useful to computer scientists working with computational and combinatorial geometry.

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. It can be recommended as an introductory book to the beautiful and rich area of discrete and computational geometry.

Suitable as a reference book for a specialist audience, as a text in an advanced course, or as an introduction for the intelligent nonspecialist in the field. It is easy to read. I recommend it for the library of every geometer.

This research monograph is accessible to undergraduates with knowledge of basic graph theory, data structures and algorithms. It can be used as an introduction to computational geometry with plenty of challenging problems.

• Joseph O'Rourke is a professor of Computer Science and of Mathematics at Smith College in Massachusetts in the USA. (And now I am a Dean at the college). My specialty is computational geometry, a mix of algorithms (CS) and geometry (Math). My most recent work and books are focused on folding & unfolding. More information at my web page: http://cs.smith.edu/~orourke/ .

• Amazon

• Geometry and Topology
• Algorithms and Data Structures
• Discrete Mathematics
• Computational and Algorithmic Mathematics
• Computational Complexity
• Art, Music, and Related Books

• Art Gallery Theorems and Algorithms (Joseph O'Rourke)
• The Mirror Site (1) - PDF
• Art Gallery Theorems (Norman Do)

• Curves and Surfaces in Geometric Modeling: Theory and Algorithms
• Algorithms in Real Algebraic Geometry (Saugata Basu, et al)
• Shape Interrogation for Computer Aided Design and Manufacturing
• Traveling Salesman Problem, Theory and Applications