About Us

Math shortcuts, Articles, worksheets, Exam tips, Question, Answers, FSc, BSc, MSc

More about us

Keep Connect with Us

  • =

Login to Your Account

Art Gallery Theorems and Algorithms by Joseph O'Rourke



Book Contents :-
1. Polygon Partitions 2. Orthogonal Polygons 3. Mobile Guards 4. Miscellaneous Shapes 5. Holes 6. Exterior Visibility 7. Visibility Graphs 8. Visibility Algorithms 9. Minimal Guard Covers 10. Three Dimensions and Miscellany

About this book :-
"Art Gallery Theorems and Algorithms" by "Joseph O’Rourke" is a foundational book in "computational geometry" that studies visibility problems in polygonal spaces. The book is centered on the famous "art gallery problem", which asks how many guards are needed to observe every point inside a polygonal gallery. O’Rourke presents the problem in a clear, structured way, combining mathematical theory with practical algorithmic thinking. The book develops key "geometric theorems" and algorithmic techniques used to analyze visibility, including polygon triangulation, partitioning methods, and guard placement strategies. It explores different gallery models such as simple polygons, orthogonal polygons, and galleries with holes. The text also introduces efficient "visibility algorithms" and discusses their computational complexity, making it valuable for understanding both theory and implementation. Written for advanced undergraduates, graduate students, and researchers, the book remains a classic reference in "algorithm design" and discrete geometry. Although later research has expanded the field, O’Rourke’s work is still widely cited for its clarity, rigorous proofs, and strong connection between geometric insight and algorithmic solutions.

Book Detail :-
Title: Art Gallery Theorems and Algorithms by Joseph O'Rourke
Publisher: Oxford University Press
Year: 1987
Pages: 296
Type: PDF
Language: English
ISBN-10 #: 0195039653
ISBN-13 #: 978-0195039658
License: External Educational Resource
Amazon: Amazon

About Author :-
The author Joseph O'Rourke is a well-known "American computer scientist" and mathematician recognized for his work in "computational geometry". He served as a professor at "Smith College", where he researched geometric algorithms, polygon theory, and visibility problems in mathematics and computer science. O’Rourke is especially famous for "Art Gallery Theorems and Algorithms", a landmark book on the "art gallery problem" and "geometric algorithms". His clear writing and rigorous approach have made complex geometric concepts accessible to students and researchers worldwide.

Similar Computational Geometry Books
Computations in Algebraic Geometry - David Eisenbud
Learn algebraic geometry using Macaulay2 in this practical book edited by David Eisenbud for advanced students and researchers.
Art Gallery Theorems and Algorithms - Joseph O'Rourke
Explore Art Gallery Theorems and Algorithms by Joseph O’Rourke, a classic book on visibility problems and computational geometry.
A Manual of Geometry and PostScript - Bill Casselman
Learn to create clear geometric illustrations using PostScript with Bill Casselman’s practical guide for students and researchers.
Computational Geometry: Methods & Apps - Jianer Chen
Learn computational geometry and geometric algorithms with Jianer Chen’s guide to convex hulls, triangulations, and Voronoi diagrams.
Combinatorial & Computational Geometry - Jacob Goodman
Learn about Combinatorial and Computational Geometry by J. E. Goodman, an essential book on discrete geometry and geometric algorithms.

.