Enjoy fast, free delivery, exclusive deals, and award-winning movies & TV shows with Prime
Try Prime
and start saving today with fast, free delivery
Amazon Prime includes:
Fast, FREE Delivery is available to Prime members. To join, select "Try Amazon Prime and start saving today with Fast, FREE Delivery" below the Add to Cart button.
Amazon Prime members enjoy:- Cardmembers earn 5% Back at Amazon.com with a Prime Credit Card.
- Unlimited Free Two-Day Delivery
- Streaming of thousands of movies and TV shows with limited ads on Prime Video.
- A Kindle book to borrow for free each month - with no due dates
- Listen to over 2 million songs and hundreds of playlists
- Unlimited photo storage with anywhere access
Important: Your credit card will NOT be charged when you start your free trial or if you cancel during the trial period. If you're happy with Amazon Prime, do nothing. At the end of the free trial, your membership will automatically upgrade to a monthly membership.
Buy new:
-14% $71.99$71.99
Ships from: Amazon Sold by: Lotus Trading
Save with Used - Very Good
$49.00$49.00
Ships from: Amazon Sold by: Grassroots Books - Reno
Download the free Kindle app and start reading Kindle books instantly on your smartphone, tablet, or computer - no Kindle device required.
Read instantly on your browser with Kindle for Web.
Using your mobile phone camera - scan the code below and download the Kindle app.
Follow the authors
OK
Discrete and Computational Geometry
Purchase options and add-ons
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.
- 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).
- ISBN-100691145539
- ISBN-13978-0691145532
- PublisherPrinceton University Press
- Publication dateMay 1, 2011
- LanguageEnglish
- Dimensions7 x 0.75 x 10 inches
- Print length272 pages
Frequently bought together

Similar items that may deliver to you quickly
Editorial Reviews
Review
"[W]e recommend this book for an undergraduate course on computational geometry. In fact, we hope to use this book ourselves when we teach such a class."---Brittany Terese Fasy and David L. Millman, SigAct News
Review
"I thoroughly enjoyed reading this book. It covers an incredibly diverse set of topics, ranging from elementary objects to deep mathematical concepts and important computational problems. Devadoss and O'Rourke have done a remarkable job of showing off the rich interplay between pure mathematics and computing that drives our research community. There really is nothing else like this on the market."―Jeff Erickson, University of Illinois, Urbana-Champaign
From the Inside Flap
"This book is ideal for people who want to learn about the topic without wading too deeply into technical details. I really like the figures, and the writing style is very nice for students, with frequent jumps into exercises. The book favors topics that are intuitive, engaging, and easily grasped. It could form the basis of an excellent undergraduate-level course for students in computer science, applied mathematics, and pure mathematics."--Samir Khuller, University of Maryland
"I thoroughly enjoyed reading this book. It covers an incredibly diverse set of topics, ranging from elementary objects to deep mathematical concepts and important computational problems. Devadoss and O'Rourke have done a remarkable job of showing off the rich interplay between pure mathematics and computing that drives our research community. There really is nothing else like this on the market."--Jeff Erickson, University of Illinois, Urbana-Champaign
From the Back Cover
"This book is ideal for people who want to learn about the topic without wading too deeply into technical details. I really like the figures, and the writing style is very nice for students, with frequent jumps into exercises. The book favors topics that are intuitive, engaging, and easily grasped. It could form the basis of an excellent undergraduate-level course for students in computer science, applied mathematics, and pure mathematics."--Samir Khuller, University of Maryland
"I thoroughly enjoyed reading this book. It covers an incredibly diverse set of topics, ranging from elementary objects to deep mathematical concepts and important computational problems. Devadoss and O'Rourke have done a remarkable job of showing off the rich interplay between pure mathematics and computing that drives our research community. There really is nothing else like this on the market."--Jeff Erickson, University of Illinois, Urbana-Champaign
About the Author
Product details
- Publisher : Princeton University Press (May 1, 2011)
- Language : English
- Hardcover : 272 pages
- ISBN-10 : 0691145539
- ISBN-13 : 978-0691145532
- Item Weight : 2.22 pounds
- Dimensions : 7 x 0.75 x 10 inches
- Best Sellers Rank: #1,550,624 in Books (See Top 100 in Books)
- #236 in Geometry
- #976 in Geometry & Topology (Books)
- #4,873 in Computer Science (Books)
- Customer Reviews:
About the authors

I am a professor of Computer Science and of Mathematics at Smith College in Massachusetts in the USA. (I previously served as Dean and Provost). My specialty is computational geometry, a mix of algorithms (CS) and geometry (Math). My most recent work and books are focused on folding & unfolding. More information at my web page: http://smith.edu/~jorourke/ .

Satyan Linus Devadoss is the Fletcher Jones Professor of Applied Mathematics and Professor of Computer Science at the University of San Diego. Before landing in the west coast, he was a professor of mathematics at Williams College for nearly 15 years, along with holding visiting positions at Stanford, Ohio State, Mathematical Sciences Research Institute, Harvey Mudd, Université Nice, and University of California, Berkeley.
An inaugural Fellow of the American Mathematical Society, and recipient of two national teaching awards from the Mathematical Association of America, he has a deep passion to make timeless mathematics timely: from building a 2-ton sculpture for Burning Man, to analyzing the genetics of beer, to painting the cartography of unsolved mathematics. His works and thoughts have appeared in venues such as NPR, the Times of London, the Washington Post, and Forbes, with support over the years from the National Science Foundation, the Mellon Foundation, the John Templeton Foundation, and the Department of Defense.
Customer reviews
Our goal is to make sure every review is trustworthy and useful. That's why we use both technology and human investigators to block fake reviews before customers ever see them. Learn more
We block Amazon accounts that violate our community guidelines. We also block sellers who buy reviews and take legal actions against parties who provide these reviews. Learn how to report
-
Top reviews
Top reviews from the United States
There was a problem filtering reviews right now. Please try again later.
Good proofs are given, which are crucial, but it is the quality of visualizations that pushes this text into the “great” category for undergraduates.
This text is most properly classified as an undergraduate resource since the pseudocode isn’t overly precise (compare with de Berg, et al or O’Rourke’s Computational Geometry in C), data structures aren’t discussed at an advanced level, and the text assumes little-to-no formal algorithms background. One might argue that such omissions are a benefit to the text, for those who are only seeing Computational Geometry for the first time and/or do not have an advanced background with regards to correctness, running-time, etc. proofs need not get weighed down with too much detail. Alas, such detail is imperative for one to truly understand Computational Geometry, but perhaps one might follow this text with de Berg et al, or another graduate text.
The last two chapters didn't seem to fit with the first five. They were very abstract, didn't mention running time analysis, and just didn't seem as practically useful as the first part of the book. The explanations in these chapters also weren't as clear, and I doubt I'd be able to implement any of it without another reference.
The later parts of the book also use a lot of more advanced topics without much explanation. There are several sections starting off like "______ is an advanced topic we can't begin to explain here, but ..." and then going on to use some advanced result or theory.
On a positive note, the Kindle version is typeset very well, and even uses color. I read in the browser, on my kindle, and in the iPad kindle reader, and it looked excellent in all three, which is not always the case for technical books with equations and figures.
It seems less widely recognized that another such field is discrete geometry.
This is a textbook on discrete geometry. requiring very modest prerequisite material.
Along the way it presents numerous math problems that no one has ever solved, and students with almost no technical background will understand the questions. Perhaps some of them will become the first to solve some of those problems.
The technical background needed to understand this book is very modest, maybe not more than a bit of high-school algebra. Nonetheless, the student will have to work hard.
Two occasions in mathematics where vector spaces over the field of rational numbers are used are proofs of the Buckingham pi theorem of physics (not in this book) and Max Dehn's solution of Hilbert's third problem, which is about dissections of polytopes. Dehn's solution appears in this book.
UNSOLVED PROBLEM 1: Which polyhedra can be partitioned into disjoint tetrahedra?
(Each unsolved problem is labeled "UNSOLVED PROBLEM" in capital letters.)
UNSOLVED PROBLEM 2: For which classes of polygons does the number of triangulations have a closed form?
UNSOLVED PROBLEM 3: Find the smallest triangulation of the n-dimensional cube into n-simplices.
UNSOLVED PROBLEM 6: Can a polygon whose edges are mirrors be covered by only one guard?
UNSOLVED PROBLEM 11: Is there a polynomial-time algorithm for counting the triangulations of a set of points in the plane?
UNSOLVED PROBLEM 12: Is there a polynomial-time algorithm for finding the distance between the nodes of a flip graph?
UNSOLVED PROBLEM 13: Is the flip graph of every point set in 3-space connected?
UNSOLVED PROBLEM 23: Show that flexing a flexible polyhedron does not change its Dehn invariant.
UNSOLVED PROBLEM 29 is the celebrated P = NP problem.
The book is clearly written with great examples. In addition, the authors state what problems are currently unproven in the field and would make great Ph. D. topics, and might even lead to to a Fields Medal, or more, if solved.
This book can be read and understood by anyone with a knowledge of basic geometry. The format of the book makes the subject palatable to even the those without a background in Mathematics.
Furthermore, the authors provide references to other more in depth texts, some of which I have read. However, this book is much better than those texts as far as understanding the subject area. I would consider this book a model for anyone writing a textbook.








