Joseph O'Rourke

Joseph O'Rourke is a Professor of Computer Science and Mathematics at Smith College and a prominent researcher in computational geometry. His work has significantly influenced the fields of geometric folding algorithms, computer graphics, and robotic motion planning. O'Rourke's most widely recognized contribution is his textbook "Computational Geometry in C," which has become a standard reference in the field since its publication in 1998. He has also authored several other influential books including "Art Gallery Theorems and Algorithms" and "How to Fold It: The Mathematics of Linkages, Origami and Polyhedra." His research has explored fundamental problems in geometric algorithms, including polygon triangulation, visibility problems, and the mathematics of folding and unfolding. O'Rourke served as Chair of the Computer Science department at Smith College and has been awarded multiple National Science Foundation grants for his research work. The impact of O'Rourke's work extends beyond academia through his contributions to practical applications in robotics and computer-aided design. He maintains an active presence in the computational geometry community and has served on numerous conference program committees and editorial boards.

Readers value O'Rourke's clear explanations of complex mathematical concepts, particularly in "Computational Geometry in C." Several reviews on Amazon note the detailed examples and practical implementation guidance. Students praise the gradual buildup from basic principles to advanced algorithms. Liked: - Thorough code examples and pseudocode - Extensive diagrams and illustrations - Rigorous but accessible mathematical proofs - Comprehensive coverage of core geometric algorithms Disliked: - Some found the C code dated compared to modern programming practices - Dense mathematical notation challenging for beginners - Limited coverage of newer computational geometry topics Ratings: - Computational Geometry in C: 4.5/5 on Amazon (62 reviews), 4.3/5 on Goodreads (89 reviews) - Art Gallery Theorems and Algorithms: 4.2/5 on Goodreads (15 reviews) - How to Fold It: 4.1/5 on Amazon (8 reviews) A graduate student reviewer noted: "The explanations strike an ideal balance between mathematical rigor and practical implementation details."

Computational Geometry in C A textbook covering fundamental algorithms in computational geometry including convex hulls, triangulation, Voronoi diagrams, and intersection detection.

Art Gallery Theorems and Algorithms An examination of the mathematics and algorithms behind art gallery problems, focusing on polygon visibility and guard placement.

Geometric Folding Algorithms: Linkages, Origami, Polyhedra A comprehensive exploration of geometric folding in mathematics, covering paper folding, protein chains, and robot arm motion.

How To Fold It: The Mathematics of Linkages, Origami and Polyhedra A mathematical introduction to folding problems, written for students and including examples from robotics and engineering applications.

Computational Geometry Column A collection of articles originally published in the International Journal of Computational Geometry and Applications, addressing various geometric computing topics.

Geometric Tools for Computer Graphics A reference work covering the mathematical foundations and computational methods used in computer graphics and geometric modeling.

Erik Demaine writes about computational geometry and mathematical algorithms, with focus on folding and reconfiguration problems. He explores theoretical computer science concepts through geometric puzzles and problems.

David Eppstein publishes works on graph algorithms, computational geometry, and geometric optimization. His writing combines discrete mathematics with algorithmic applications in computer graphics and visualization.

Herbert Edelsbrunner produces texts on computational topology and geometric algorithms. His work covers persistent homology, alpha shapes, and the intersection of geometry with data analysis.

Franco P. Preparata writes about computational geometry fundamentals and algorithmic design. His publications focus on geometric searching, convex hulls, and parallel algorithms for geometric problems.

Mark de Berg creates texts on computational geometry data structures and algorithm analysis. His work emphasizes practical applications of geometric algorithms in robotics and geographic information systems.