- 出版社: Springer; 3rd ed. 2008 (2008年3月7日)
- 精装: 386页
- 语种： 英语
- ISBN: 3540779736
- 条形码: 9783540779735
- 商品尺寸: 19 x 3.2 x 24.1 cm
- 商品重量: 925 g
- ASIN: 3540779736
- 用户评分: 分享我的评价
- 亚马逊热销商品排名: 图书商品里排第669,471名 (查看图书商品销售排行榜)
Computational Geometry: Algorithms and Applications (英语) 精装 – 2008年3月7日
"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
Computational Geometry: Introduction.- Line Segment Intersection: Thematic Map Overlay.- Polygon Triangulation: Guarding an Art Gallery.- Linear Programming: Manufacturing with Molds.- Orthogonal Range Searching: Querying a Database.- Point Location: Knowing Where You Are.- Voronoi Diagrams: The Post Office Problem.- Arrangements and Duality: Supersampling in Ray Tracing.- Delaunay Triangulations: Height Interpolation.- More Geometric Data Structures: Windowing.- Convex Hulls: Mixing Things.- Binary Space Partitions: The Painter's Algorithm.- Robot Motion Planning: Getting Where You Want to Be.- Quadtrees: Non-Uniform Mesh Generation.- Visibility Graphs: Finding the Shortest Route.- Simplex Range Searching: Windowing Revisited.- Bibliography.- Index.
|5 星 (0%)|
|4 星 (0%)|
|3 星 (0%)|
|2 星 (0%)|
|1 星 (0%)|
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.