Computational Geometry and over 2 million other books are available for Amazon Kindle . Learn more
Buy Used
Condition: Used: Like New
Comment: Used Good condition book may have signs of cover wear and/or marks on corners and page edges. Inside pages may have highlighting, writing and underlining. All purchases eligible for Amazon customer service and a 30-day return policy.
Have one to sell?
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See this image

Computational Geometry: Algorithms and Applications Hardcover – 28 Jan 2000

See all 2 formats and editions Hide other formats and editions
Amazon Price New from Used from
Kindle Edition
"Please retry"
"Please retry"
£25.55 £10.84

There is a newer edition of this item:

Product details

  • Hardcover: 367 pages
  • Publisher: Springer; 2nd rev. ed. edition (28 Jan. 2000)
  • Language: English
  • ISBN-10: 3540656200
  • ISBN-13: 978-3540656203
  • Product Dimensions: 17.8 x 2.2 x 25.4 cm
  • Average Customer Review: 4.5 out of 5 stars  See all reviews (2 customer reviews)
  • Amazon Bestsellers Rank: 2,113,779 in Books (See Top 100 in Books)
  • See Complete Table of Contents

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
Explore More
Browse Sample Pages
Front Cover | Copyright | Table of Contents | Excerpt | Index | Back Cover
Search inside this book:

Customer Reviews

4.5 out of 5 stars
5 star
4 star
3 star
2 star
1 star
See both customer reviews
Share your thoughts with other customers

Most Helpful Customer Reviews

4 of 4 people found the following review helpful By Anders on 11 Jan. 2007
Format: Hardcover
I use this book quite often as a reference. Having read and studied most topics in

this book I must say it cover the basics that will give you the understanding of

how to develop geometric algorithms for other problems.

I am a CS graduate student, and therefore have the basic knowledge of

algorithms and complexity analysis, and such -- I don't know if you

will enjoy the book without this knowledge, but why buy a book on

computational geometry, if these topics are out of your interest area?
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
16 of 18 people found the following review helpful By A Customer on 21 Jan. 2004
Format: Hardcover
I bought this book because the blurb said "This book is largely self-contained and can be used for self-study...". Not exactly, ok there are end of chapter exercises but where are the answers? If I knew enough to check them myself I would not need the book!
The book also suggests use for "high-level undergraduate and low-level graduate courses" this is very true, don't kid yourself you'll understand it unless you have or are in the final year of a first technical degree.
Also note that the algorithms are in pseudo-code so if you want quick results you'll not find them here. I like this idea, however, as it makes you concentrate on the general ideas rather than any particular programming languages'implementation of them.
The book is well organised and has good diagrams to help you understand the concepts but is more suited for students as a degree course book than for self-study.
If the answers were available on the book's web-site I would have given it 5 stars.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again

Most Helpful Customer Reviews on (beta) 8 reviews
63 of 63 people found the following review helpful
Good Introduction but look elsewhere for detailed reference 31 Jan. 2003
By Jason - Published on
Format: Hardcover
(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.
(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".
18 of 19 people found the following review helpful
Extremely well written 26 Oct. 2002
By Jacob Marner - Published on
Format: 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.
8 of 9 people found the following review helpful
Lucid and Complete 18 Jun. 2001
By Wayne Miller - Published on
Format: Hardcover
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.
3 of 3 people found the following review helpful
Good book, not for a primer 5 Feb. 2009
By Fuga Federico - Published on
Format: Hardcover Verified Purchase
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.
2 of 2 people found the following review helpful
Excellent Background 13 Jun. 2007
By Scott Johnson - Published on
Format: Hardcover Verified Purchase
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.
Were these reviews helpful? Let us know