- Use promo code PRIMEBOOKS18 to save $5.00 when you spend $20.00 or more on Books offered by Amazon.com. Enter code PRIMEBOOKS18 at checkout. Here's how (restrictions apply)
Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.
To get the free app, enter your mobile phone number.
Computational Geometry: Algorithms and Applications 3rd Edition
Use the Amazon App to scan ISBNs and compare prices.
Fulfillment by Amazon (FBA) is a service we offer sellers that lets them store their products in Amazon's fulfillment centers, and we directly pack, ship, and provide customer service for these products. Something we hope you'll especially enjoy: FBA items qualify for FREE Shipping and Amazon Prime.
If you're a seller, Fulfillment by Amazon can help you increase your sales. We invite you to learn more about Fulfillment by Amazon .
See the Best Books of 2018 So Far
Looking for something great to read? Browse our editors' picks for the best books of the year so far in fiction, nonfiction, mysteries, children's books, and much more.
Special offers and product promotions
"An excellent introduction to the field is given here, including a general motivation and usage cases beyond simple graphics rendering or interaction." from the ACM Reviews by William Fahle, University of Texas at Dallas, USA
Top customer reviews
There was a problem filtering reviews right now. Please try again later.
1. The introductions to each chapter are verbose and has irrelevant, boring examples
2. The most relevant part of each chapter is the algorithm. The algorithms part has a lot of terse proofs, and non-intuitive descriptions. Please refer to the Fortune's Voronoi diagram algorithm as an example. By reading this chapter, not even a great student will be able to simply implement it. It's just a long winding, bunch of dry proofs, and then steps of the algorithm, which develops no understanding, that it simply is the intersection of the parabolas that satisfy the requirement of the Voronoi partition.
3. The research section towards the end presents some examples, but most of the ideas in these are also not developed to further understanding.
I blame this book for turning many smart students away from Computational Geometry. Given that it's considered the standard text book in CG.
Difficulty level: make sure you know some asymptotic analysis and discrete mathematics to get the best out of it, but could be read by anyone who can code i believe (although again, he'll miss a lot of beautiful mathematics)
Again, i'm very satisfied with it.
Most recent customer reviews
It is very useful and easy to understand.