1 Qhull computes convex hulls, Delaunay triangulations, halfspace
2 intersections about a point, Voronoi diagrams, furthest-site Delaunay
3 triangulations, and furthest-site Voronoi diagrams. It runs in 2-d,
4 3-d, 4-d, and higher dimensions. It implements the Quickhull algorithm
5 for computing the convex hull. Qhull handles roundoff errors from
6 floating point arithmetic. It computes volumes, surface areas, and
7 approximations to the convex hull.
9 WWW: http://www.qhull.org