Computational Geometry: Algorithms and Applications and over 360,000 other books are available for Amazon Kindle – Amazon’s new wireless reading device. Learn more

19 used & new from $19.48

Have one to sell? Sell yours here
 
 
Computational Geometry: Algorithms and Applications, Second Edition
 
 
Start reading Computational Geometry: Algorithms and Applications on your Kindle in under a minute.

Don’t have a Kindle? Get your Kindle here.
 
  

Computational Geometry: Algorithms and Applications, Second Edition (Hardcover)

~ Mark de Berg (Author), M. van Krefeld (Author), M. Overmars (Author), O. Schwarzkopf (Author) "Good solutions to algorithmic problems of geometric nature are mostly based on two ingredients..." (more)
Key Phrases: Zone Theorem, Thales's Theorem, Art Gallery Theorem
4.4 out of 5 stars  See all reviews (16 customer reviews)


Available from these sellers.


11 new from $38.28 8 used from $19.48

Formats

Amazon Price New from Used from
  Kindle Edition $24.92 -- --
  Hardcover $31.15 $31.15 $38.80
  Hardcover, February 18, 2000 -- $38.28 $19.48

Customers Who Bought This Item Also Bought

Computational Geometry in C (Cambridge Tracts in Theoretical Computer Science)

Computational Geometry in C (Cambridge Tracts in Theoretical Computer Science)

by Joseph O'Rourke
4.2 out of 5 stars (6)  $30.88
Computational Geometry: An Introduction (Monographs in Computer Science)

Computational Geometry: An Introduction (Monographs in Computer Science)

by Franco P. Preparata
4.3 out of 5 stars (6)  $94.88
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics)

Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics)

by Hanan Samet
4.9 out of 5 stars (7)  $61.43
Algorithmic Geometry

Algorithmic Geometry

by Jean-Daniel Boissonnat
5.0 out of 5 stars (1)  $61.20
The Algorithm Design Manual

The Algorithm Design Manual

by Steven S. Skiena
4.5 out of 5 stars (34)  $61.15
Explore similar items

Editorial Reviews

Product Description

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 the second edition, besides revisions to the first edition, a number of new exercises have been added.

Product Details

  • Hardcover: 379 pages
  • Publisher: Springer; 2nd edition (February 18, 2000)
  • Language: English
  • ISBN-10: 3540656200
  • ISBN-13: 978-3540656203
  • Product Dimensions: 9.7 x 7.7 x 1 inches
  • Shipping Weight: 1.9 pounds
  • Average Customer Review: 4.4 out of 5 stars  See all reviews (16 customer reviews)
  • Amazon.com Sales Rank: #489,215 in Books (See Bestsellers in Books)

Inside This Book (learn more)
First Sentence:
Good solutions to algorithmic problems of geometric nature are mostly based on two ingredients. Read the first page
Key Phrases - Capitalized Phrases (CAPs): (learn more)
Zone Theorem, Thales's Theorem, Art Gallery Theorem
New!
Concordance | Text Stats
Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Search Inside This Book:


What Do Customers Ultimately Buy After Viewing This Item?


Tags Customers Associate with This Product

 (What's this?)
Click on a tag to find related items, discussions, and people.
 

Your tags: Add your first tag
 

 

Customer Reviews

16 Reviews
5 star:
 (10)
4 star:
 (4)
3 star:
 (1)
2 star:    (0)
1 star:
 (1)
 
 
 
 
 
Average Customer Review
4.4 out of 5 stars (16 customer reviews)
 
 
 
 
Share your thoughts with other customers:
Most Helpful Customer Reviews

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

Comment Comment (1) | Permalink | Was this review helpful to you? Yes No (Report this)



 
16 of 16 people found the following review helpful:
5.0 out of 5 stars Extremely well written, October 26, 2002
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.

Comment Comment | Permalink | Was this review helpful to you? Yes No (Report this)



 
13 of 14 people found the following review helpful:
5.0 out of 5 stars The best computational geometry book!, May 4, 1999
By A Customer
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.

Comment Comment | Permalink | Was this review helpful to you? Yes No (Report this)


Share your thoughts with other customers: Create your own review
 
 
 
Most Recent Customer Reviews

4.0 out of 5 stars Concise reference for computational geometry
This book covers the concepts and algorithms concisely and hence forms a very handy reference to Computational Geometry. Read more
Published 7 months ago by G. K. Pai

5.0 out of 5 stars 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. Read more
Published 9 months ago by Fuga Federico

5.0 out of 5 stars 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,... Read more
Published 10 months ago by J. Catrambone

5.0 out of 5 stars 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. Read more
Published on June 13, 2007 by Scott Johnson

3.0 out of 5 stars 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. Read more
Published on December 26, 2005 by Chengiz

4.0 out of 5 stars Interesting read, excellent theory, no code
This book serves as a survey of computational geometry algorithms. The explanations are very readable. Read more
Published on August 4, 2001 by E. Fletcher Dunn

4.0 out of 5 stars Clear and concise
The book is well written and easy to understand. An ideal book for someone planning to apply computation geometry for real-life problems. Read more
Published on June 26, 2001 by Mr. Sajan Mathews

5.0 out of 5 stars Lucid and Complete
Compared to other texts on Computational Geometry, like the Preparata / Shamos collection -- this book is simple to read; it's very well written. Read more
Published on June 18, 2001 by Wayne Miller

5.0 out of 5 stars In a way an old friend...
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. Read more
Published on November 27, 2000 by Jarno Peschier

5.0 out of 5 stars Makes for a great class
I taught a class using that book, and I found it an invaluable help as an instructor in presenting the material. Read more
Published on March 10, 2000

Only search this product's reviews



Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 


Active discussions in related forums
Search Customer Discussions
Search all Amazon discussions
   



So You'd Like to...


Create a guide

Product Information from the Amapedia Community

Beta (What's this?)


Look for Similar Items by Category


Look for Similar Items by Subject

 

Feedback

If you need help or have a question for Customer Service, contact us.
 Would you like to update product info or give feedback on images?
Is there any other feedback you would like to provide?

Your comments can help make our site better for everyone.



Your Recent History

 (What's this?)

After viewing product detail pages or search results, look here to find an easy way to navigate back to pages you are interested in.