Order from a Major Online Bookstore
Ultimate Book Price Comparison Engine
Save Your Time And Money
| AnyBook4Less.com | Order from a Major Online Bookstore |
|
| Home | Store List | FAQ | Contact Us | | ||
| Ultimate Book Price Comparison Engine Save Your Time And Money |
||
 |
Title: Computational Geometry by Mark De Berg, Marc Van Kreveld, Mark Overmars, Otfried Schwarzkopf, Mark de Berg, M. Van Kreveld ISBN: 3-540-65620-0 Publisher: Springer Verlag Pub. Date: 18 February, 2000 Format: Hardcover Volumes: 1 List Price(USD): $44.95 |
Average Customer Rating: 4.36 (11 reviews)
Rating: 5
Summary: The best computational geometry book!
Comment: I also completely disagree with the one-star review below. The "Dutch book" is the clearest, most complete, most up-to-date, best designed, best illustrated computational geometry textbook out there. Some of the material may be a bit advanced for undergraduates (and for those people I would recommend Joe O'Rourke's excellent "Computational Geometry in C"), but for graduate students and other researchers who want to learn computational geometry, this book is absolutely essential.
This is an algorithms textbook, though, not a textbook full of code. You will not find compilable code in the author's favorite programming language du jour -- this may be what the first reviewer meant by "desperately needed details". What you will find is clear, correct, well-motivated explanations of the underlying algorithms, data structures, and mathematics.
The book does have a few faults. The motivating examples are often forced ("mixing things" for convex hulls??). The authors deliberately chose to show only one algorithm for each problem they consider, and occasionally the algorithm they chose is not the simplest or most efficient. But these are minor points.
If you're going to buy just one computational geometry book, this is the one to get.
Rating: 5
Summary: The Beginning of a new era in writing!
Comment: I agree to the reader from Masachusets that some pseudocode in the book has some small errors, but this is acceptable(first editions of books ALWAYS have mistakes if difficult matter are dealt). My opinion is that the pseudocode induced by the algorithms are given for the sake of completeness! What a researcher needs is the PHILOSOPHY of the algorithm NOT the code. The code can be found in full detail(involving all or some degenerate cases) in other books like Computational Geometry in C, Though I do not see the reason why C should be the dominant language... Also this book is written for clever minds, there is no reason to unleash your bitterness towards the book because you can not understand it! But the mistakes in the book are there ! So normaly I would have given to it a 4 star but since this book fortells what the books will look like in the future,(A combination of Techicality and also Philosophy) I put 5 stars! My total impression of the book is that it is a MUST have book and should be in the collection of every serious researcher involved in this field! Bravo to de Berg!
Rating: 4
Summary: Good Introduction but look elsewhere for detailed reference
Comment: Pro:
(1) Each chapter begins with a practical example. For example, the chapter computing intersections of lines starts with a discussion of a map-making application that goes into enough detail to see how the algorithms they present would be useful. This is a considerable step up from the common practice in algorithms literature of motivation by way of vaguely mentioning some related field (i.e. "These string matching algorithms are useful in computational biology"). This book does a much better job of motivating the material it presents, but if you're primarily interested in the abstract problem, these sections can be skipped.
(2) Each chapter is relatively self-contained. Feel free to skip ahead to subjects that interest you.
(3) Surprisingly readable. Unlike most technical material, one can read an entire chapter in a single sitting without missing much. Generally, each chapter will develop a single algorithm for a single kind of problem.
(4) It's very up to date. This second edition is less than two years old, it includes some new results in the field.
Con:
(1) Algorithms are only given in pseudocode. The emphasis is on describing algorithms and data structures clearly and completely. If you're looking for a "cookbook" with code to copy and paste into an application, perhaps O'Rourke's "Computational Geometry in C" would be a better choice.
(2) There are many important advanced results that are not discussed in the main text. An obvious example is the first chapter, which describes a well-known convex hull algorithm that takes O(n log n) time but algorithms that are faster for most inputs are mentioned only in the "Notes and Comments" at the end of the chapter. Someone interested in lots of gory details would be well-served to combine this book with Boissonnat and Yvinec's more detailed and mathematical "Algorithmic Geometry".
 |
Title: Computational Geometry in C by Joseph O'Rourke ISBN: 0521649765 Publisher: Cambridge University Press Pub. Date: 15 February, 2001 List Price(USD): $37.00 |
 |
Title: Computational Geometry: An Introduction (Texts and Monographs in Computer Science) by Franco P. Preparata, Michael Ian Shamos ISBN: 0387961313 Publisher: Springer Verlag Pub. Date: August, 1993 List Price(USD): $76.95 |
 |
Title: Geometric Tools for Computer Graphics by Philip Schneider, David Eberly ISBN: 1558605940 Publisher: Morgan Kaufmann Pub. Date: 26 September, 2002 List Price(USD): $69.95 |
 |
Title: Geometry and Topology for Mesh Generation by Herbert Edelsbrunner, P. G. Ciarlet, A. Iserles, R. V. Kohn, M. H. Wright ISBN: 0521793092 Publisher: Cambridge University Press Pub. Date: 28 May, 2001 List Price(USD): $45.00 |
 |
Title: Algorithmic Geometry by Jean-Daniel Boissonnat, Mariette Yvinec, H. Bronniman ISBN: 0521565294 Publisher: Cambridge University Press Pub. Date: 15 February, 2001 List Price(USD): $50.00 |
Thank you for visiting www.AnyBook4Less.com and enjoy your savings!
Copyright� 2001-2021 Send your comments
