This is the revised and expanded 1998 edition of a popular introduction to the design and implementation of geometry algorithms arising in areas such as computer graphics, robotics, and engineering design. The basic techniques used in computational geometry are all covered: polygon triangulations, convex hulls, Voronoi diagrams, arrangements, geometric searching, and motion planning. The self-contained treatment presumes only an elementary knowledge of mathematics, but reaches topics on the frontier of current research, making it a useful reference for practitioners at all levels. The second edition contains material on several new topics, such as randomized algorithms for polygon triangulation, planar point location, 3D convex hull construction, intersection algorithms for ray-segment and ray-triangle, and point-in-polyhedron. The code in this edition is significantly improved from the first edition (more efficient and more robust), and four new routines are included. Java versions for this new edition are also available. All code is accessible from the book's Web site (http://cs.smith.edu/~orourke/) or by anonymous ftp.
| ||||||||||||||||||
 Trade In this Item for up to £1.60
Trade in Computational Geometry in C (Cambridge Tracts in Theoretical Computer Science) for an Amazon.co.uk gift card of up to £1.60, which you can then spend on millions of items across the site. Trade-in values may vary (terms apply). Special Offer until June 30, 2013: Receive an additional £5 promotional Gift Card, when you trade-in at least £10 worth of books. Learn more
|
Book Description
Frequently Bought Together
Product details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, and more.
Product Description
Review
'… the author does an excellent job of explaining difficult concepts in an accessible, even entertaining, manner … If this is your field, this is your book!' Developers Review
'The balanced combination of careful descriptions, examples, algorithms and exercises makes it a pleasure to read …'. Zentralblatt
'Anyone who wants to know what this field is all about should read this book! The book is a pleasure to read, as questions that arise naturally in the reader's mind are answered, in almost all cases, in the following paragraph. The style strikes an ideal balance between rigor and informality. Mr O'Rourke must be a wonderful teacher and I envy his students.' Miriam L. Lucian, Society for Industrial and Applied Mathematics
'The balanced combination of careful descriptions, examples, algorithms and exercises makes it a pleasure to read …'. Zentralblatt
'Anyone who wants to know what this field is all about should read this book! The book is a pleasure to read, as questions that arise naturally in the reader's mind are answered, in almost all cases, in the following paragraph. The style strikes an ideal balance between rigor and informality. Mr O'Rourke must be a wonderful teacher and I envy his students.' Miriam L. Lucian, Society for Industrial and Applied Mathematics
Book Description
This is the revised and expanded 1998 edition of a popular tutorial on the design and implementation of geometry algorithms. The self-contained treatment presumes only an elementary knowledge of mathematics but includes the latest research topics, making it an excellent resource for programmers in computer graphics, robotics, and engineering design.
Inside This Book
(Learn More)
First Sentence
Much of computational geometry performs its computations on geometrical objects known as polygons. Read the first page
Front Cover | Copyright | Table of Contents | Excerpt | Index | Back Cover
Much of computational geometry performs its computations on geometrical objects known as polygons. Read the first page
Explore More
Concordance
Browse Sample PagesConcordance
Front Cover | Copyright | Table of Contents | Excerpt | Index | Back Cover
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
What Other Items Do Customers Buy After Viewing This Item?
Customer Reviews
Most Helpful Customer Reviews
4 of 4 people found the following review helpful
By A Customer
Format:Paperback|Amazon Verified Purchase
This is beyond any doubt a must have for any student/researcher/programmer interested in computational geometry. The book is very well-written and presents all ideas and algorithms in a way that allows the reader to use them and implement them directly. The book does not have the depth of theoretical analysis of the classic reference of Shamos and Preparata, but is far more useful in practice from the computer scientist's / engineer's point if view.
3 of 3 people found the following review helpful
By Alun Williams
VINE™ VOICE
Format:Paperback|Amazon Verified Purchase
What this book covers it usually covers well and in an interesting and thoughtful way. An undergraduate following a computer science course teaching several of the topics in this book would probably find it very useful. However, if you come to this book expecting it to solve some particular geometric problem you are liable to be disappointed. In particular there is little or no material relating to graphical questions. In the course of the book's 8 proper chapters (there is a chapter 9 listing further possible sources of information) there are only 12 algorithms given in full. Most of the book is taken up with various questions relating to convex hulls (two chapters), polygons, and polyhedra (three chapters). The other chapters are about Voronoi diagrams and motion planning. The latter is one of the few chapters where the author considers questions about circles in detail.
The author has a strong aversion to the use of floating point numbers and recommends using integers instead, though he is fairly silent on what one is supposed to do if the data being dealt with is naturally floating point in character. The emphasis on integer arithmetic means that in numerous places he is forced to discuss questions about overflow. He has a somewhat optimistic attitude to special cases - even though is often the case that the main practical difficulty of dealing with a geometric problem on a computer lies in handling special cases correctly.
Overall, this is a good book for the programmer interested in geometric questions to have on his bookshelf, but it is unlikely to be the only one he or she will need, or even the most useful.
The author has a strong aversion to the use of floating point numbers and recommends using integers instead, though he is fairly silent on what one is supposed to do if the data being dealt with is naturally floating point in character. The emphasis on integer arithmetic means that in numerous places he is forced to discuss questions about overflow. He has a somewhat optimistic attitude to special cases - even though is often the case that the main practical difficulty of dealing with a geometric problem on a computer lies in handling special cases correctly.
Overall, this is a good book for the programmer interested in geometric questions to have on his bookshelf, but it is unlikely to be the only one he or she will need, or even the most useful.
By J. Jack
Format:Paperback
For the aspiring computer scientist or student alike - this book gives you a clear way forward into the computational geometry field and presents lemmas and proofs every step of the way. Thought and intelligence required.
2 of 3 people found the following review helpful
Format:Paperback
Well presented and thought through, however it does tend to go around the block before getting to the point. A Lack of example code which doesn't help, but for the most part, but still a good book, and reccomended.
Would you like to see more reviews about this item?
›
Go to Amazon.com to see all 6 reviews
4.2 out of 5 stars
Were these reviews helpful?
Let us know
Listmania!
Look for similar items by category
- Books > Computing & Internet > Digital Lifestyle > Online Shopping > Amazon
- Books > Computing & Internet > Programming > Algorithms > C & C++
- Books > Computing & Internet > Programming > Algorithms > Computational Geometry
- Books > Science & Nature > Mathematics > Geometry & Topology
- Books > Science & Nature > Popular Science > Maths
- Books > Scientific, Technical & Medical > Mathematics
Feedback
- Would you like to update product info or give feedback on images?
- I am the Author, and I want to comment on my book.
- I am the Publisher, and I want to comment on this book.
|
