**Up:** *Directory of Computational Geometry Software*

## Collections

### 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"

This series of five books (so far!) describes algorithms for
computer graphics. Of interest to computational geometers are
the wacky primitives, and some of the higher-level algorithms,
especially in Graphics Gems IV, eg.
Delaunay triangulation and an algorithm for the
polygonization of an implicit surface.
Take a look at the new table of contents
and see if they've got what you want.

The programs are available by
ftp from Princeton, or try
Stanford.

**Up:** *Directory of Computational Geometry Software*

*The Geometry Center Home Page*
Comments to: nina@geom.umn.edu