OROURKE - Computational Geometry Codes

OROURKE contains computational geometry codes written by Joseph O'Rourke.

Reference:
Joseph O'Rourke,
Computational Geometry,
Cambridge University Press,
Second Edition, 1998.

ARM determines an arm configuration to reach a given target. Files you may copy include:

CHULL determines the convex hull of points in 3D. Files you may copy include:

COMB determines the vertex coordinates for a comb polygon in 2D. Files you may copy include:

CONVCONV determines the intersection of two convex polygons in 2D. Files you may copy include:

CUBE generates points evenly distributed in a cube in 3D. Files you may copy include:

DT determines the Delaunay triangulation of points in 2D. Files you may copy include:

GRAHAM determines the convex hull of points in 2D. Files you may copy include:

INHEDRON determines if a point is in a polyhedron in 3D. Files you may copy include:

INPOLY determines if a point is in a polygon in 2D. Files you may copy include:

MINK computes the Minkowski sum of two polygons in 2D. Files you may copy include:

SEGSEG determines the intersection of two line segments in 2D. Files you may copy include:

SPHERE generates points evenly distributed on a sphere in 3D. Files you may copy include:

SPIRAL generates spiral points on the surface of a sphere in 3D. Files you may copy include:

TRI computes a triangulation of a polygon in 2D. Files you may copy include:

Back to the C software page.


Last revised on 24 March 2001.