This book covers traditional topics such as convex hulls, triangulations, and Voronoi diagrams, as well as more recent subjects like pseudotriangulations, curve reconstruction, and locked chains. It also touches on more advanced material, including Dehn invariants, associahedra, quasigeodesics, Morse theory, and the recent resolution of the Poincaré conjecture. Connections to real-world applications are made throughout, and algorithms are presented independently of any programming language. This richly illustrated textbook also features numerous exercises and unsolved problems.
The essential introduction to discrete and computational geometry
Covers traditional topics as well as new and advanced material
Features numerous full-color illustrations, exercises, and unsolved problems
Suitable for sophomores in mathematics, computer science, engineering, or physics
Rigorous but accessible
An online solutions manual is available (for teachers only). To obtain access, please e-mail: Vickie_Kearn@press.princeton.edu