Code from books

Code from books

Code from "Computational Geometry in C"

Polygon area
2-D convex hull
3-D convex hull
Delaunay triangulation
point in polygon
polygon extreme point
convex polygon intersection
planar robot arm reachability, no obstacles

The best documentation is the book!

By Joe O'Rourke, Smith College.
Get the code by ftp from Smith.

Code from "Graphics Gems"

Lots of wacky primitives, and some interesting higher-level algorithms, especially in Graphics Gems IV, eg. a C++ implementation of an incremental 2-D Delaunay triangulation.

Take a look at the table of contents and see if they've got what you want.

The programs are available by ftp from Princeton.

Up: Directory of Computational Geometry Software

[HOME]

The Geometry Center Home Page

Created: May 31 1995 ---