The essential introduction to discrete and computational geometry—now fully updated and expanded

Discrete and Computational Geometry bridges the theoretical world of discrete geometry with the applications-driven realm of computational geometry, offering a comprehensive yet accessible introduction to this cutting-edge frontier of mathematics and computer science. Beginning with polygons and ending with polyhedra, it explains how to capture the shape of data given by a set of points, from convex hulls and triangulations to Voronoi diagrams, geometric duality, chains, linkages, and alpha complexes. Connections to real-world applications are made throughout, and algorithms are presented independent of any programming language. Now fully updated and expanded, this richly illustrated textbook is an invaluable learning tool for students in mathematics, computer science, engineering, and physics.

Now with new sections on duality and on computational topology
Project suggestions at the end of every chapter
Covers traditional topics as well as new and advanced material
Features numerous full-color illustrations, exercises, and fully updated unsolved problems
Uniquely designed for a one-semester class
Accessible to college sophomores with minimal background
Also suitable for more advanced students
Online solutions manual (available to instructors)