1. Calculate convex hulls and related structures These executables use a practical convex hull algorithm that combines the two-dimensional Quickhull Algorithm with the general dimension Beneath-Beyond Algorithm. This algorithm is robust against floating point errors, often a problem for less sophisticated computational geometry algorithms. There are also programs that perform related computations, such as Delaunay triangulation. From Debian 3.0r0 APT