Excellent Background | Computational Geometry: Algorithms and Applications

The definitive guide to computational geometry. | Computational Geometry: Algorithms and Applications | Mark de Berg, Otfried Cheong, ...

books:


	• Computational Geometry: Algorithms and Applications Mark de Berg, Otfried Cheong, ... Springer, 2008 - 386 pages average customer review:based on 15 reviews view larger image
	for more information click here

highly recommended

Concise reference for computational geometry

This book covers the concepts and algorithms concisely and hence forms a very handy reference to Computational Geometry. You could use this as the starting point for any Comp Geom application and build on that. I am pretty happy with this buy!

Excellent Background

This book is extremely well written, easy to understand, and actually is the standard text for Computational Geometry classes, as far as I know. The only thing I didn't like about it was that there seemed to be a few errors in some of the pseudocode. But, it's to be expected when publishing a textbook, and I think it'll probably be cleared up in future editions.

Overall, great book. I'd recommend it to anyone taking graphics or a computational geometry class.

for more information click here

The definitive guide to computational geometry.

When studying computer science, one will encounter a number of books. "The Dinosaur Book", Operating System Concepts (7th Edition), "The White Book", Introduction to Algorithms, "The Green Book", Artificial Intelligence: A Modern Approach (2nd Edition) (Prentice Hall Series in Artificial Intelligence), and a select few more. The best way to articulate my satisfaction with this material is to refer to it as "The Blue and Yellow Book."

Each chapter is introduced with a problem. For example, "How would one install cameras on the inside of an art gallery (represented by a polygon) such that each wall can be observed with as few cameras as possible." The chapter then presents the material in a clear, concise fashion, and applies this newfound information to solve said problem.

It could be argued that the book is math heavy; certainly those with a strong grip on linear algebra and geometry will have an easier time, but those without can still grasp the material enough to benefit. For those interested in proofs, there's no shortage in the book, either.

Strongly recommended and a great deal of fun to read.

for more information click here

Important book but substandard layout and typesetting

This is one of the really few computational geometry books available. It fills a niche and does it decently. However it could be better:

1. The chapter layout is not very good. There are many "revisiting this" and "we saw in chapter so-and-so".

2. The mathematical proofs are often written in a single paragraph full of "English" interspersed with mathematical notation, instead of the tried and true way of numbered equations and one-per explanations. This makes for disconcerting reading.

3. The book in general could have done with more math and code, and less "English", not to mention more and better diagrams -- they tend to be sparsely detailed (ie. a picture is worth only a hundred words). The arrangement of diagrams also needs to be better: some are in the margins, some are in the middle, again not easy and intuitive to follow.

Hopefully a future edition will address this issues.

for more information click here

Good book, not for a primer

The subject is not easy, so the book is surely not for a primer on graphical programming, even more for a primer on computation and algorithms.
But if you need some very advanced algorithms to solve any computational geometry problem, you'll find it here. Maybe the very latest advances on subject are not present here (a new revision of this book is available, not much news on that, look for the difference on the web).
Thanks to the author, whom I asked a clarification on an algorithm present in the book, and responded in less than 3 hours.

This well-accepted introduction to computational geometry is a textbook for high-level undergraduate and low-level graduate courses. The focus is on algorithms and hence the book is well suited for students in computer science and engineering. Motivation is provided from the application areas: all solutions and techniques from computational geometry are related to particular applications in robotics, graphics, CAD/CAM, and geographic information systems. For students this motivation will be especially welcome. Modern insights in computational geometry are used to provide solutions that are both efficient and easy to understand and implement. All the basic techniques and topics from computational geometry, as well as several more advanced topics, are covered. The book is largely self-contained and can be used for self-study by anyone with a basic background in algorithms.

In this third edition, besides revisions to the second edition, new sections discussing Voronoi diagrams of line segments, farthest-point Voronoi diagrams, and realistic input models have been added.

for more information click here

reviews: page 1, 2, 3

hot