Computational Geometry in C

Computational Geometry in C presents fundamental algorithms for solving geometric problems in two and three dimensions. The book covers core topics including convex hulls, triangulation, Voronoi diagrams, and geometric intersection detection. Each chapter introduces geometric concepts through practical examples and clear illustrations, with complete C code implementations provided. The text balances mathematical theory with programming considerations, making the material accessible to both students and practitioners. Implementation notes and exercises accompany each algorithm, allowing readers to verify their understanding through hands-on practice. The code is designed to be both efficient and readable, serving as a reference for real-world applications. This work stands as a bridge between theoretical geometry and practical computer science, demonstrating how abstract mathematical concepts translate into working software solutions. The emphasis on visual understanding and concrete implementation makes complex geometric principles tangible.

Readers value this book as a practical introduction to computational geometry algorithms, with clear C implementations and mathematical foundations. Likes: - Code examples that translate theory into working implementations - Step-by-step derivations of geometric algorithms - Focus on core concepts without excessive theory - Quality illustrations that aid understanding - Exercises with varying difficulty levels Dislikes: - Some readers found the C code dated (pre-ANSI C) - Mathematical notation can be dense for beginners - Limited coverage of advanced topics - A few readers noted minor errors in problem solutions Ratings: Goodreads: 3.88/5 (26 ratings) Amazon: 4.2/5 (11 reviews) One reader noted: "The explanations strike the right balance between rigor and accessibility." Another mentioned: "The code helped me implement these algorithms in my graphics project, though I had to modernize the syntax." Several academic course syllabi continue to recommend this as a supplementary text for computational geometry classes.

Computational Geometry: Algorithms and Applications by Mark de Berg, Otfried Cheong, Marc van Kreveld, and Mark Overmars The book presents fundamental geometric algorithms with practical implementations in multiple programming languages.

Real-Time Collision Detection by Christer Ericson This text focuses on geometric algorithms specifically for collision detection and spatial reasoning in computer graphics and games.

Geometric Tools for Computer Graphics by Philip Schneider and David H. Eberly The book provides implementations of geometric algorithms with detailed mathematical foundations and source code examples.

Introduction to Algorithms by Thomas H. Cormen This comprehensive text includes geometric algorithms within its broader coverage of computer science fundamentals and implementations.

Graphics Gems series by Andrew S. Glassner (Editor) These volumes contain practical geometric algorithms and code snippets for graphics programming challenges.

🔹 Joseph O'Rourke has made significant contributions to the field of computational origami, bridging the gap between geometry and the ancient art of paper folding. 🔹 The book became a cornerstone text in computer graphics education, particularly influencing the development of collision detection algorithms used in modern video games. 🔹 Computational geometry emerged as a distinct field in the 1970s, largely driven by the need to solve practical problems in computer graphics, robotics, and CAD systems. 🔹 The algorithms presented in the book are fundamental to many real-world applications, from calculating the shortest route between two points to designing efficient building evacuation plans. 🔹 The author, while at Smith College, developed the "Toothpick Sequence" - a mathematical sequence that grows by following simple geometric rules, demonstrating how complex patterns can emerge from basic geometric principles.