Computational Geometry: Algorithms and Applications

The book arrived in perfect condition. This is a great book for anyone interested in knowing more about computational geometry algorithms. The pedagogical approach is well suited for self-learners as well as for students in computer science curriculae.

La caja venía con bastante daño, pero el libro impecable, buen empaquetado

The book came in great condition. I think this book is printed on-demand, and it felt that my copy just came out of the printing. Very pleased.The content is great, I immediately found some techniques to solve the problems that I am working on at the moment.

This book is a must to all researchers and students of the field. The algorithms are always presented in the context of an application, which makes it the more understandable. However, the authors chose to present them in a very high level of abstraction, and some of the finer details - so important in these algorithms - are only mentioned, which may pose a problem to obtaining a suitable, efficient implementation of them in a programming language.

Beautiful book, solid contents. I learned a lot from it and had a nice time practicing with the exercises. Lots of examples and problems, a lot of interesting algorithms and techniques, every chapter is a progressive refinement of a particular idea to solve a problem expressed as geometry.Difficulty level: make sure you know some asymptotic analysis and discrete mathematics to get the best out of it, but could be read by anyone who can code i believe (although again, he'll miss a lot of beautiful mathematics)Again, i'm very satisfied with it.

It is a joy to read and review this book -- the exposition is crystal clear; the writing style is warm and engaging (not too terse and not too verbose), conveying understanding and not just stating facts, theorems, and algorithms; the graphics are great (numerous richly detailed illustrations); the topics hit the heart of computational geometry; the historical remarks help set context; and the book is beautifully typeset and printed on high quality acid free paper.

This is a computer science textbook for undergraduates. Lots of "real world" uses for computational geometry to egg-on the unmotivated. Not so good for those that ARE already motivated.The text glosses over basic tasks such as "whether a point lies to the left or right of a directed line" (page 4) with the expectation that some unnamed library function will do this. For me, not so. Moreover I'd would have liked to read a geometric proof of such things. The foundations are left out, yet elsewhere they waste space to give us Pythagoras' Theorem.

I like this book. The shipment was fast as well. I have this project that requires constant use of algorithms presented in this book. It could be better if the well known voronoi delaunay triangulation parts were kept minimal, but this might be a little subjective comment.