|
||||||||||||||||||||||||||||||||||||||
|
3 Reviews
|
Average Customer Review
Share your thoughts with other customers
Create your own review
|
|
9 of 11 people found the following review helpful:
4.0 out of 5 stars
very good if a little specialized
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.
Published on October 21, 1998 by Nina Amenta (amenta@cs.utexas.edu)
|
 |
1 of 9 people found the following review helpful:
1.0 out of 5 stars
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 !
Published on October 24, 2003 by CHENG-CHUNGLI
|
|
Most Helpful First | Newest First
|
|
9 of 11 people found the following review helpful:
4.0 out of 5 stars
very good if a little specialized,
By Nina Amenta (amenta@cs.utexas.edu) (Austin, Texas, USA) - See all my reviews
This review is from: Computational Geometry: An Introduction Through Randomized Algorithms (Paperback)
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.
2 of 2 people found the following review helpful:
4.0 out of 5 stars
not for beginners,
By
This review is from: Computational Geometry: An Introduction Through Randomized Algorithms (Paperback)
Much of the book's material is best appreciated with at least an undergrad degree in maths or computer science. A typical computer programmer, who has not had to delve deeply into theoretical maths, might be treading water. The presentation style assumes a strong background in the rigorous proving of theorems.
Nor are there any convenient code snippets. If it's actual code, you'll need to translate from the abstractions of the text.
1 of 9 people found the following review helpful:
1.0 out of 5 stars
Poor Textbook,
By CHENG-CHUNGLI (Taipei,Taiwan) - See all my reviews
This review is from: Computational Geometry: An Introduction Through Randomized Algorithms (Paperback)
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 !
|
|
Most Helpful First | Newest First
|
|
Computational Geometry: An Introduction Through Randomized Algorithms by Ketan Mulmuley (Paperback - June 18, 1993)
$77.00
In Stock | |
 
| ||
