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.

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.

The book is well written and easy to understand. An ideal book for someone planning to apply computation geometry for real-life problems. This is not a definitive book for computational geometry, but does give you good examples and ideas. Could do with more references to figures. There is scope for expansion of this book to include more detailed case studies and more pseudo code examples

Compared to other texts on Computational Geometry, like the Preparata / Shamos collection -- this book is simple to read; it's very well written.

I cannot understate the clarity of the book; if you try comparing this to other graduate texts on Computational Geometry -- this one blows them away.

I think it covers a broad range of topics and covers them well. It is a wealth of algorithms.

I really liked the contents of this book when it was really still the syllabus of a course I followed at Utrecht University while studying there. Because of me, this book contains a little less typing mistakes than it would have otherwise.

Very interesting and even though the subject being explained is often very complex in nature, the way it is is presented makes it easier to follow than it could have been.

Very good. I even bought a copy after having graduated when I saw it was finally out as a book. I still keep it in a prominent place on my bookshelf.

I taught a class using that book, and I found it an invaluable help as an instructor in presenting the material. Teaching layered range trees and fractional cascading for instance benefits immensely from the detailed pictures of the book. At times, I find the motivation part somewhat stretched, or limited, but always informative for the student, and giving a concrete, hands-on aspect to the topic. The algorithms are almost all practical -- and practiced! It's a book your students will keep on their shelf for a while even after the class is over. And the layout is clear. It certainly does not rule out other books (like the classic Preparata-Shamos, or O'Rourke's) because it does sometimes not cover problems covered in those books, but it adds a lot to them, so even if you have them, you might want to consider this one.

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!

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.

I completely disagree with the above commentor who evaluates it as a kind of bad book.

I can not find any errors in pseudo code, and it's very easy for me to understand and follow. It contains hundreds of figures which help students understand the concepts. The idea is so clear, and followed by good examples. It's also worth reading for all computer scientists and mathematicians who are working on geometry. I highly recommend to use it as a text for Graduate course.

It can be worth being the "BIBLE" of all computational geometers.

This text is far to vague, avoiding desperately needed details and examples to support the theories and algorithms it presents. The psuedo-code is frequently filled with errors, and is difficult to follow. A rotten book altogether.