Home :: Books :: Professional & Technical  

Arts & Photography
Audio CDs
Audiocassettes
Biographies & Memoirs
Business & Investing
Children's Books
Christianity
Comics & Graphic Novels
Computers & Internet
Cooking, Food & Wine
Entertainment
Gay & Lesbian
Health, Mind & Body
History
Home & Garden
Horror
Literature & Fiction
Mystery & Thrillers
Nonfiction
Outdoors & Nature
Parenting & Families
Professional & Technical

Reference
Religion & Spirituality
Romance
Science
Science Fiction & Fantasy
Sports
Teens
Travel
Women's Fiction
Computational Geometry

Computational Geometry

List Price: $49.95
Your Price: $37.49
Product Info Reviews

<< 1 2 >>

Rating: 4 stars
Summary: Interesting read, excellent theory, no code
Review: This book serves as a survey of computational geometry algorithms. The explanations are very readable. The authors have taken special care to prove algorithm correctness and time complexity bounds.

Although I have yet to actually implement one of the algorithms in the book directly, I was exposed to a number of general techniques which I have used, such as randomized techniques to eliminate pathological worst-case performance problems, and various space partitioning techniques.

The algorithms are all presented in pseudocode, unfortunately, which is the reason for only 4 out of 5 stars. Also, some important details are omitted which make a few of their algorithms practically useless (although they are interesting theoritically). For example, there is an algorithm for pathfinding and collision avoidance for a translating (but not ROTATING!) robot.

If you're lookin for a computational geometry bible, this isn't it. But there are certainly some gems in this book and it is a very interesting read.

Rating: 4 stars
Summary: Interesting read, excellent theory, no code
Review: This book serves as a survey of computational geometry algorithms. The explanations are very readable. The authors have taken special care to prove algorithm correctness and time complexity bounds.

Although I have yet to actually implement one of the algorithms in the book directly, I was exposed to a number of general techniques which I have used, such as randomized techniques to eliminate pathological worst-case performance problems, and various space partitioning techniques.

The algorithms are all presented in pseudocode, unfortunately, which is the reason for only 4 out of 5 stars. Also, some important details are omitted which make a few of their algorithms practically useless (although they are interesting theoritically). For example, there is an algorithm for pathfinding and collision avoidance for a translating (but not ROTATING!) robot.

If you're lookin for a computational geometry bible, this isn't it. But there are certainly some gems in this book and it is a very interesting read.


<< 1 2 >>

© 2004, ReviewFocus or its affiliates