Computational Geometry: An Introduction Through Randomized Algorithms
| Author | : | |
| Rating | : | 4.59 (564 Votes) |
| Asin | : | 0133363635 |
| Format Type | : | paperback |
| Number of Pages | : | 447 Pages |
| Publish Date | : | 2015-08-15 |
| Language | : | English |
DESCRIPTION:
. From the Publisher This up-to-date and concise introduction to computational geometry -- with emphasis on simple randomized methods -- is designed for quick, easy access to beginners
It also explores higher dimensional advanced applications and provides exercises.. It emphasizes simple randomized methods, developing basic principles with the help of planar applications, beginning with deterministic algorithms and shifting to randomized algorithms as the problems become more complex. This introduction to computational geometry is designed for beginners
very good if a little specialized Nina Amenta (amenta@cs.utexas.edu) 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.. CHENG-CHUNGLI said Poor Textbook. 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 !