- Hardcover: 386 pages
- Publisher: Springer; 3rd ed. 2008 edition (7 March 2008)
- Language: English
- ISBN-10: 3540779736
- ISBN-13: 978-3540779735
- Product Dimensions: 19 x 3.2 x 24.1 cm
- Average Customer Review: Be the first to review this item
- Amazon Bestsellers Rank: #4,95,501 in Books (See Top 100 in Books)
Computational Geometry: Algorithms and Applications Hardcover – 7 Mar 2008
Customers who bought this item also bought
Customers who viewed this item also viewed
"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
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 mobile phone number.
No customer reviews
|5 star (0%)|
|4 star (0%)|
|3 star (0%)|
|2 star (0%)|
|1 star (0%)|
Review this product
Most helpful customer reviews on Amazon.com
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.