Computational Geometry: Algorithms and Applications [Hardcover]

Mark de Berg (Author), Otfried Cheong (Author), Marc van Kreveld (Author), Mark Overmars (Author)

Book Description

ISBN-10: 3540779736 | ISBN-13: 978-3540779735 | Publication Date: April 16, 2008 | Edition: 3rd

This introduction to computational geometry focuses on algorithms. Motivation is provided from the application areas as all techniques are related to particular applications in robotics, graphics, CAD/CAM, and geographic information systems. Modern insights in computational geometry are used to provide solutions that are both efficient and easy to understand and implement.

Editorial Reviews

Review

"An excellent introduction to the field is given here, including a general motivation and usage cases beyond simple graphics rendering or interaction." from the ACM Reviews by William Fahle, University of Texas at Dallas, USA

Product Details

• Hardcover: 398 pages
• Publisher: Springer; 3rd edition (April 16, 2008)
• Language: English
• ISBN-10: 3540779736
• ISBN-13: 978-3540779735
• Product Dimensions: 9.7 x 8 x 1.1 inches
• Shipping Weight: 2 pounds (View shipping rates and policies)
• Average Customer Review: 4.4 out of 5 stars  See all reviews (18 customer reviews)
• Amazon Best Sellers Rank: #50,675 in Books (See Top 100 in Books)
  • #18 in Books > Computers & Technology > Computer Science > Artificial Intelligence > Robotics
  • #62 in Books > Computers & Technology > Computer Science > Software Engineering > Information Systems

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

Most Helpful Customer Reviews

55 of 55 people found the following review helpful:

4.0 out of 5 stars Good Introduction but look elsewhere for detailed reference, January 30, 2003

By 

Jason (Illinios) - See all my reviews

This review is from: Computational Geometry: Algorithms and Applications, Second Edition (Hardcover)

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".

16 of 16 people found the following review helpful:

5.0 out of 5 stars Extremely well written, October 26, 2002

By 

Jacob Marner (Denmark) - See all my reviews
(REAL NAME)   

This review is from: Computational Geometry: Algorithms and Applications, Second Edition (Hardcover)

Algorithm books are often quite hard to understand, but this is not the case with this book. The information is very compact so it is a slow read but due to the high quality of the text this is only an advantage. You are never left wondering what the authors might have meant with a certain statement.

The book focuses solely on theory, so it presents no real source code (only pseudo-code) which I think is good thing since that would otherwise have polluted the clarity of the explanations.

Many of the topics it covers has been a help to me as a programmer. Can be recommended for anyone interested in computation geometry - but it requires some computer science maturity so I don't recommend it unless you have a bachelor's degree in C.S. or something similar.

Jacob Marner, M.Sc.

15 of 16 people found the following review helpful:

5.0 out of 5 stars The best computational geometry book!, May 4, 1999

By A Customer

This review is from: Computational Geometry: Algorithms and Applications (Hardcover)

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.