- Series: Cambridge Tracts in Theoretical Computer Science (Paperback)
- Paperback: 392 pages
- Publisher: Cambridge University Press; 2 edition (October 13, 1998)
- Language: English
- ISBN-10: 0521649765
- ISBN-13: 978-0521649766
- Product Dimensions: 7 x 0.8 x 10 inches
- Shipping Weight: 1.9 pounds (View shipping rates and policies)
- Average Customer Review: 13 customer reviews
- Amazon Best Sellers Rank: #357,698 in Books (See Top 100 in Books)
Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.
To get the free app, enter your mobile phone number.
Computational Geometry in C (Cambridge Tracts in Theoretical Computer Science (Paperback)) 2nd Edition
Use the Amazon App to scan ISBNs and compare prices.
Fulfillment by Amazon (FBA) is a service we offer sellers that lets them store their products in Amazon's fulfillment centers, and we directly pack, ship, and provide customer service for these products. Something we hope you'll especially enjoy: FBA items qualify for FREE Shipping and Amazon Prime.
If you're a seller, Fulfillment by Amazon can help you increase your sales. We invite you to learn more about Fulfillment by Amazon .
"Children of Blood and Bone"
Tomi Adeyemi conjures a stunning world of dark magic and danger in her West African-inspired fantasy debut. Pre-order today
Frequently bought together
Customers who bought this item also bought
Customers who viewed this item also viewed
"This is an applied approach to fundamental concepts in computational geometry and should be read by every serious practitioner....From a pedagogical point of view, this book is an excellent choice for both undergraduate classes (perhaps with more emphasis on the implementations) and graduate classes (considering a number of the exercises) because of the extensive exercises that review, explore details, and encourage further reading." Computing Reviews
"Conveys the feeling that computational geometry is interesting, exciting, important, and very active." SIGACT News
"Anyone who wants to know what this field is all about should read this book!...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." Siam Review
"...the book is an excellent basis for a course on computational geometry; many interesting exercises and hints for further reading give suitable guidance for teachers and for students." Mathematical Reviews
This is the newly revised and expanded edition of the most suitable textbook for introducing undergraduate students in computer science and mathematics to the design of geometry algorithms. Such algorithms lie at the core of a variety of practical areas, including 3D game program design, geographical information systems, manufacturing design, and robotics. The self-contained treatment presumes only an elementary knowledge of mathematics, but reaches topics on the frontier of current research. Thus, though it is designed for a course at the advanced undergraduate level, it can be used for graduate courses as well. Numerous exercises are provided at the end of every section; a partial solutions manual is available.A novel aspect of the book is the inclusion of working computer programs for many of the algorithms. Students will enjoy the interplay between practical programming issues and the latest theoretical developments; many student projects can be built on the provided code.
Top customer reviews
There was a problem filtering reviews right now. Please try again later.
The ability to visualize objects in an abstract subject like algebraic geometry boils down to, in the case of toric varieties, to a consideration of how to manipulate polytopes geometrically. A major portion of the book, if not all of it, is devoted to the computational geometry of polyhedra. Because it is an introductory book, some more advanced topics, such as Bayesian methods to find similarities between polyhedra, and neural network approaches to classifying polyhedral objects are not treated. Readers who need to do such things will be well-prepared for them after a study of this book. In addition, there are good exercises assigned at the end of each chapter, so the book could be used in the classroom. Some readers will however choose to use it as a reference source, and it would be a good one, for the author gives references to topics that he only touched upon in the book.
Some particular areas that were treated especially well were: 1. The discussion on data structures for surfaces of polyhedra. Although not very general, since he choose to deal with only triangulated polytopes, readers who need to be more general will have a good start in this discussion. 2. The discussion on volume overflow and how to deal with it using robust computation. 3. The discussion, albeit short, of the randomized incremental algorithm. 4. The treatment on the minimum spanning tree and Kruskal's algorithm. Communication network performance optimization is now a major application of this algorithm and others in graph theory, including the author's later discussion of Dijkstra's algorithm.
I give the book four stars for two reasons.
First, the coverage of floating-poing precision issues is almost non-existant: most of the algorithms are integer-only. A survey chapter over techniques for handling FP precision issues would be *VERY* welcome. (After all, geometric algorithms are most often applied to floating-point data in the real world.) Judging by the quality of existing bibliography, I think the author would make an outstanding job on this topic. (Hint for the 3rd edition :-))
Second, I have strong objections against the coding style used in this book: the presented code is an excellent demonstration of how to obfuscate C programs by using typedefs and hungarian notation (inconsistently!) applied in postfix. (NOTE: I have 10+ years of experience in C and C++ coding, so I'm not just a "little bit confused").