Automotive Holiday Deals BOTYKT Shop Women's Dresses Learn more nav_sap_SWP_6M_fly_beacon Indie for the Holidays egg_2015 All-New Amazon Fire TV Luxury Beauty Gifts Under $100 Street Art Project Amazon Gift Card Offer aos aos aos Amazon Echo Starting at $49.99 Kindle Voyage AntMan Outdoor Deals on Amazon.com Deals

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.

  • Apple
  • Android
  • Windows Phone
  • Android

To get the free app, enter your email address or mobile phone number.
Download to your computer
Kindle Cloud Reader

Computational Geometry in C (Cambridge Tracts in Theoretical Computer Science) 2nd Edition

by
Joseph O'Rourke (Author)
› Visit Amazon's Joseph O'Rourke Page
Find all the books, read about the author, and more.
See search results for this author
Are you an author? Learn about Author Central
Joseph O'Rourke (Author)
4.3 out of 5 stars 9 customer reviews
ISBN-13: 978-0521649766
ISBN-10: 0521649765
Why is ISBN important?
ISBN
This bar-code number lets you verify that you're getting exactly the right version or edition of a book. The 13-digit and 10-digit formats both work.
Scan an ISBN with your phone
Use the Amazon App to scan ISBNs and compare prices.
Sell yours for a Gift Card
We'll buy it for $7.47
Learn More
Trade in now
Have one to sell? Sell on Amazon

Sorry, there was a problem.

There was an error retrieving your Wish Lists. Please try again.

Sorry, there was a problem.

List unavailable.
Facebook Twitter Pinterest
Rent On clicking this link, a new layer will be open
$18.88 - $23.46 On clicking this link, a new layer will be open
Buy used On clicking this link, a new layer will be open
$31.19 On clicking this link, a new layer will be open
Buy new On clicking this link, a new layer will be open
$47.20 On clicking this link, a new layer will be open
More Buying Choices
34 New from $36.98 29 Used from $14.98
63 used & new from $14.98
See All Buying Options
Free Two-Day Shipping for College Students with Amazon Student Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student

Get Up to 80% Back Rent Textbooks
$47.20 FREE Shipping. In Stock. Ships from and sold by Amazon.com. Gift-wrap available.

Frequently Bought Together

  • Computational Geometry in C (Cambridge Tracts in Theoretical Computer Science)
  • +
  • Discrete and Computational Geometry
  • +
  • Computational Geometry: Algorithms and Applications
Total price: $153.95
Buy the selected items together

Customers Who Bought This Item Also Bought

Page 1 of 1 Start overPage 1 of 1
This shopping feature will continue to load items. In order to navigate out of this carousel please use your heading shortcut key to navigate to the next or previous heading.
Back
  1. Computational Geometry: Algorithms and Applications
    Mark de Berg
    4.1 out of 5 stars 15
    Hardcover
    $41.13 Prime
  2. Discrete and Computational Geometry
    Satyan L. Devadoss
    3.8 out of 5 stars 5
    Hardcover
    $65.62 Prime
  3. Computational Geometry: An Introduction (Texts and Monographs in Computer Science)
    Franco P. Preparata
    4.4 out of 5 stars 8
    Hardcover
    $97.83 Prime
  4. The Algorithm Design Manual
    Steven S Skiena
    4.3 out of 5 stars 101
    #1 Best Seller in Combinatorics
    Paperback
    $74.26 Prime
  5. Computational Geometry: Algorithms and Applications
    Mark de Berg
    4.1 out of 5 stars 15
    Paperback
    $49.95 Prime
  6. Delaunay Mesh Generation (Chapman & Hall/CRC Computer and Information Science Series)
    Siu-Wing Cheng
    5.0 out of 5 stars 1
    Hardcover
    $95.50 Prime
Next

Customers Viewing This Page May Be Interested In These Sponsored Links

  (What's this?)
1.  MSc in Computer Science opens new browser window
  -  
Experience Unique Research & Education At Masdar Institute!
www.masdar.ac.ae/computer-science
NO_CONTENT_IN_FEATURE
Hero Quick Promo
Up to 85% Off Over 1,000 Kindle Books
Visit our Holiday Deals store and save up to 85% on more than 1,000 Kindle books. These deals are valid until December 31, 2015. Learn more

Product Details

  • Series: Cambridge Tracts in Theoretical Computer Science
  • 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: 4.3 out of 5 stars  See all reviews (9 customer reviews)
  • Amazon Best Sellers Rank: #373,631 in Books (See Top 100 in Books)

    •  Would you like to update product info or give feedback on images?

Customer Reviews

Most Helpful Customer Reviews

14 of 14 people found the following review helpful
Very hepful
By Dr. Lee D. Carlson HALL OF FAMEVINE VOICE on May 9, 2002
Format: Paperback
Anyone who is involved in areas such as computer graphics, computational radiology, robot vision, or visualization software should have a copy of this book. The author has done a fine job of introducing the most important algorithms in computational geometry, choosing the C language for their implementation. The choice of C might be somewhat dated now, since C++ is now beginning to dominate computational geometry, but readers who are actually programming these algorithms using C++ can easily extend the ones in the book to C++. Not all of the algorithms in the book are implemented into C, unfortunately, but the clarity of presentation is done well enough to make this implementation a fairly straightforward task. My interest in the book came from a need to design and implement algorithms for polyhedra in VRML and toric varieties in algebraic geometry. This book, along with others, was a great help in that regard. The running time of these algorithms was not really an issue with me, so the detail the author spends on discussing the complexity of the algorithms was not a concern. Readers who need to pay attention to running-time issues will appreciate his discussion of them for the algorithms that are presented.
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.Read more ›
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
22 of 25 people found the following review helpful
A clear, concise text on fundamental Computational Geometry
By Bob Williamson (rwillia1@tuelectric.com) on July 17, 1998
Format: Paperback
O'Rourke's approach reflects the essence of both "Computational Geometry" and the "C language" --- concise yet profound. The book covers the core subjects of Computational Geometry: polygon partitioning, convex hulls, Voronoi diagrams / Delaunay triangulation, "arrangements" of lines, geometric searching, and motion planning.
The book assumes some familiarity with the C language, but is very readable even for non-C programmers. This is an excellent text for use as an introduction to Computational Geometry, a primer for Preparata & Shamos, while at the same time it's an excellent addendum to that more seminal text. By weaving working code into his presentation, O'Rourke gives traction to the powerful engine of Preparata & Shamos.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
11 of 13 people found the following review helpful
Nice balance of theory with code
By Jason on February 2, 2003
Format: Paperback
This book was pleasantly surprising: I had expected to see code presented with minimal motivation or discussion of the underlying ideas -- something of a "Computational Geometry for Dummies" sort of book. That's not the case at all. This is a bona fide textbook on the subject, suitable for an undergraduate course.
It covers all of the the "classical" topics: convex hulls, line segment intersection, polygon triangulation, Voronoi diagrams, motion planning.
The mode of presentation -- supporting a discussion of the theories with implementable code -- is actually a bit refreshing. For comparison: Other books, when discussing the line segment intersection problem (ie: Given a set of line segments, find all of their intersection points) simply assume that computing the intersection of a pair of segments can be done in constant time. This is not an especially difficult problem, but the discussion seems more complete with a brief description of how this might be done. The same can be said about other primitive tests and operations in other algorithms.
Overall, this book can stand alone as an excellent introduction to computational geometry, but a serious student in the subject will want more: perhaps Preparata and Shamos or de Berg et. al.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
42 of 56 people found the following review helpful
okay content, mediocre presentation
By Pete Gonzalez (gonz@ratloop.com) on March 1, 1999
Format: Paperback
This book provides a reasonable introduction to the field of computational geometry, although the notation is sometimes sloppy and the author frequently makes inconsistent assumptions about the reader. For example, on the first page he refers to a circle as a "one-dimensonial set of points," which although valid from a toplogical perspective is a little confusing in an introductory text. As another example, the first exercise refers to "every point in dP," presumably meaning just the corner points (otherwise the problem would be unsolvable). The book also sets up a lot of irrelevant mathematical definitions that generally obfuscate the presentation rather than clarifying it. Although not prohibitive for the ambitious reader, these needless hindrances are at best a little annoying.
Secondly, I must criticize the text's scope, in light of the important role computational geometry has played in modern computer graphics. There is no discussion of clipping, culling, occlusion (e.g. BSP, octree, OBB), or even non-polygon primitives -- important topics arguably more useful to the target audience than e.g. convex hulls (to which over 1/4 of the book's pages are devoted).
Regardless, this book (combined with a professor and a course) probably would serve quite well as an undergraduate text. Readers interested in a cookbook of applied graphics algorithms, however, should look elsewhere.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse

Set up an Amazon Giveaway

Amazon Giveaway allows you to run promotional giveaways in order to create buzz, reward your audience, and attract new followers and customers. Learn more
Computational Geometry in C (Cambridge Tracts in Theoretical Computer Science)
This item: Computational Geometry in C (Cambridge Tracts in Theoretical Computer Science)
Price: $47.20
Ships from and sold by Amazon.com
Set up a giveaway

There's a problem loading this menu right now.

Learn more about Amazon Prime.



Want to discover more products? Check out these pages to see more: tracts in theoretical computer science, geometry and fourth dimension, cambridge university press geometry, theoretical computer science, spatial tessellations:concepts and applications of voronoi diagrams