What do you think?
Rate this book
Discrete and Computational Geometry
An essential introduction to discrete and computational geometry
Discrete geometry is a relatively new development in pure mathematics, while computational geometry is an emerging area in applications-driven computer science. Their intermingling has yielded exciting advances in recent years, yet what has been lacking until now is an undergraduate textbook that bridges the gap between the two. Discrete and Computational Geometry offers a comprehensive yet accessible introduction to this cutting-edge frontier of mathematics and computer science.
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.
Discrete geometry is a relatively new development in pure mathematics, while computational geometry is an emerging area in applications-driven computer science. Their intermingling has yielded exciting advances in recent years, yet what has been lacking until now is an undergraduate textbook that bridges the gap between the two. Discrete and Computational Geometry offers a comprehensive yet accessible introduction to this cutting-edge frontier of mathematics and computer science.
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.
- GenresMathematicsReference
272 pages, Hardcover
First published April 11, 2011
10 people are currently reading
50 people want to read
Ratings & Reviews
Friends & Following
Create a free account to discover what your friends think of this book!
Community Reviews
Displaying 1 - 3 of 3 reviews
November 28, 2021
Much more improved, and clearer reference than O'Rourkes original work. Graphics are very helpful.
June 15, 2017
The book is written very well and makes the concepts it covers easy to understand if you have some knowledge in higher math and computer science, but the first few chapters should be easy enough to grasp without. It provides workable exercises and lists some current open problems, making this more of a reference than a textbook and more approachable for introducing the concepts.
January 16, 2022
Top. A bird's view of discrete (computational) geometry.
An amazing read that will give you the needed intuition to move to more serious readings.
An amazing read that will give you the needed intuition to move to more serious readings.
Displaying 1 - 3 of 3 reviews