Computational Geometry: An Introduction Through Randomized Algorithms

Rating:
Summary: very good if a little specialized
Review: An in-depth look at randomized incremental algorithms in computational geometry. Since this appears to be the most successful and practical approach for classic problems like convex hull, Voronoi diagram and polygon triangulation, this would be a good book to own if you own just one. Especially if you are interested in theory.

Rating:
Summary: very good if a little specialized
Review: An in-depth look at randomized incremental algorithms in computational geometry. Since this appears to be the most successful and practical approach for classic problems like convex hull, Voronoi diagram and polygon triangulation, this would be a good book to own if you own just one. Especially if you are interested in theory.

Rating:
Summary: Poor Textbook
Review: This book is not suitable for beginners.It doesn't explain some important theorems and rules clearly,especially for "history" data structues , my classmates also can't understand how to implement it in detail ! All materials of this book seems uilding on auther's personal imaging !