×

Uh-oh, it looks like your Internet Explorer is out of date.

For a better shopping experience, please upgrade now.

Computational Geometry in C / Edition 2
     

Computational Geometry in C / Edition 2

by Joseph O'Rourke
 

See All Formats & Editions

ISBN-10: 0521649765

ISBN-13: 9780521649766

Pub. Date: 10/28/1998

Publisher: Cambridge University Press

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

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.

Product Details

ISBN-13:
9780521649766
Publisher:
Cambridge University Press
Publication date:
10/28/1998
Edition description:
New Edition
Pages:
390
Product dimensions:
6.97(w) x 9.96(h) x 0.79(d)

Table of Contents

1. Polygon triangulation; 2. Polygon partitioning; 3. Convex hulls in two dimensions; 4. Convex hulls in three dimensions; 5. Voronoi diagrams; 6. Arrangements; 7. Search and intersection; 8. Motion planning; 9. Sources.

Customer Reviews

Average Review:

Post to your social network

     

Most Helpful Customer Reviews

See all customer reviews