Shows animations of algorithms for computing the convex hull in two or three dimensions. Extensive instruction and explanation is available through Help files.

For the two-dimensional convex hull, the user may enter up to fifty points and choose between two (extreme edge, incremental) algorithms for computing the convex hull.

For the three-dimensional case, the user may enter points in three dimensions, or select from a number of pre-loaded pointsets, and then compute the convex hull by an incremental algorithm.