Computational Geometry in C

By Lee Stemkoski

Book Overview

This is the newly revised and expanded edition of the popular introduction to the design and implementation of geometry algorithms arising in areas such as computer graphics, robotics, and engineering design. 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. A new Sources chapter points to supplemental literature for readers needing more information on any topic. A novel aspect is the inclusion of working C code for many of the algorithms, with discussion of practical implementation issues. 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 code in this new edition is significantly improved from the first edition, 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

• Format: Paperback
• Language: English
• ISBN: 0521649765
• ISBN13: 9780521649766
• Release Date: October 1998
• Publisher: Cambridge University Press
• Length: 392 Pages
• Weight: 1.65 lbs.
• Dimensions: 0.8" x 7.0" x 9.9"

Customer Reviews

collates useful computational geometric algorithms

If you are perhaps a graphics or robotics programmer, then you will often have need for computing various geometric forms. And the intersections of these forms. Rather than derive algorithms from scratch, you might want to first look here. O'Rourke has collated several useful sets of methods. Germane to two and three dimenions. Convex hulls are important enough that he devotes 2 chapters to these. While the somewhat related...

Nice balance of theory with code

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,...

Very hepful

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...

my rewiew

i think that these website is very.it has everything that i need. all of my books are from amazan.

A clear, concise text on fundamental Computational Geometry

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...