8 Computational Geometry Books That Shape Expert Knowledge

After years of research in algorithm design, Mark de Berg and his co-authors developed this textbook to bridge the gap between complex geometric problems and accessible solutions. You’ll explore modern algorithmic techniques that simplify and speed up classical challenges in computational geometry, with applications ranging from computer graphics to robotics. The book lays out these concepts clearly, making it suitable for both structured courses and independent study, especially with detailed chapters on geometric data structures and algorithmic paradigms. If your goal is to understand the core computational methods behind geometric problem-solving, this book offers a solid, methodical approach without unnecessary complexity.

Joseph O'Rourke, a professor blending computer science and mathematics, offers you a deep dive into geometry algorithms with this second edition focused on design and implementation. You'll explore randomized algorithms for polygon triangulation, 3D convex hulls, and intersection methods, all accompanied by working C code that brings theory to practice. The book assumes only basic math knowledge but takes you all the way to cutting-edge research, making it a solid pick whether you're a student or a practitioner. For example, the "Sources" chapter guides you to further readings, enriching your understanding beyond the core material.

This tailored book explores computational geometry through a lens crafted specifically for your background and goals. It covers fundamental concepts such as geometric algorithms, spatial data structures, and polygon triangulation, while delving deeper into advanced topics like Voronoi diagrams and combinatorial geometry. By focusing on your interests and skill level, it reveals intricate problem-solving techniques and practical applications in graphics, robotics, and CAD. This personalized approach ensures you engage with material that resonates with your experience, accelerating your mastery of complex geometric challenges and helping you confidently apply these concepts in your projects or research.

Aditya Chatterjee, an algorithmic researcher and founding member of OPENGENUS, wrote this book to sharpen your problem-solving mindset specifically for coding interviews. You’ll tackle five carefully chosen problems that cover foundational computational geometry concepts like shortest distances in 3D, mirror images in 2D, and closest pair computations. Each problem is paired with efficient algorithms, relevant theorems, and implementations, making it a focused tool for reinforcing key skills quickly. If you’re preparing for technical interviews and want a concise, targeted approach to computational geometry, this book aligns well with your goals, though it’s less suited for deep theoretical exploration.

This book brings together deep expertise from Efi Fogel and colleagues, who have long shaped computational geometry through both research and teaching. You’ll explore the CGAL arrangements package — a robust C++ framework tackling the tricky problem of curve arrangements, essential for applications from robot motion planning to molecular biology. The authors walk you through example-driven explanations and real application programs, like computing minimum-area triangles or coordinating moving discs among obstacles. If you’re comfortable with C++ and generic programming, this guide offers concrete, worked-out solutions that bridge theory and practice in computational geometry.

Michael Joswig, a recognized authority in advanced algorithmic geometry, combines deep expertise and practical insights to explore algorithmic geometry and its applications in this work. You gain a detailed understanding of polyhedral structures, including algorithms for convex hulls, Voronoi diagrams, and Delone triangulations, alongside a rigorous treatment of algebraic geometry concepts like Gröbner bases and polynomial equation solving. The text bridges computational geometry with algebraic geometry, optimization, and numerical mathematics, making it especially suited for those interested in theoretical foundations as well as practical applications in computer graphics and robotics. If you seek a mathematically rich perspective on computational geometry that balances theory and application, this book is a solid choice.

This tailored book offers a focused journey into computational geometry, designed to match your background and accelerate your progress in just 30 days. It explores core geometric concepts and algorithms while examining practical applications relevant to your interests, ensuring each chapter addresses your specific learning goals. The content synthesizes foundational principles with advanced topics, guiding you step-by-step through increasingly complex material in a clear and engaging manner. By concentrating on your personal objectives, this book provides a carefully curated pathway through computational geometry that reveals both theoretical insights and hands-on problem-solving techniques. Its personalized approach helps you build confidence quickly and deepens your understanding of key structures and computational methods essential for mastery.

What happens when deep expertise in combinatorial geometry meets algorithm design? Herbert Edelsbrunner, a leading figure in computational geometry, explores this intersection by dissecting how combinatorial structures influence algorithm efficiency and vice versa. You’ll find the book divided into three parts: foundational combinatorial concepts, computational methods, and practical applications, each revealing how geometric transforms illuminate connections across problems. For instance, Edelsbrunner demonstrates how understanding the combinatorial nature of space partitioning leads to more efficient algorithms, making this an informative read if you’re tackling geometric computations or studying algorithmic geometry. While technical, it’s well suited for those immersed in theoretical computer science rather than casual readers.

Horst Nowacki's expertise in computational geometry and ship design shapes this focused exploration of mathematical methods tailored for naval engineering. You’ll find detailed treatments of curve and surface techniques essential for CAD applications, along with interpolation and approximation methods directly applied to ship curve design and fairing. The book walks you through how modern computational approaches enhance the evaluation and production of ship surface geometries, supported by evolving CAD modeling systems. If your work involves ship design or engineering geometry, this text offers precise, technical insights that bridge theory with practical application.

Martin Held's extensive expertise in computational geometry and mechanical engineering shaped this focused examination of pocket machining challenges. You gain a deep understanding of how to select and optimize tool paths using Voronoi diagrams, supported by detailed algorithmic explanations and implementation insights. The book bridges theory and practice, presenting a graph-based abstraction to model pocket geometry for efficient machining. If your work involves CNC programming or algorithm design for manufacturing, you’ll find this rigorous yet practical resource directly applicable to improving machining precision and efficiency.