Qhull includes options for hull volume, facet area, multiple output formats, and graphical output. It can approximate a convex hull. Qhull handles roundoff errors from floating point arithmetic. Any exact convex hull must lie between the inner and outer plane. Qhull uses joggled input or merged facets.
Joggled input guarantees a simplicial output, but it is less accurate than merged facets.
For merged facets, Qhull reports the maximum outer and inner plane. Stony Brook's Algorithm Repository on computational geometry. For example, a Pentium 166 computes the Delaunay triangulation of 1000 points in 3-d in one CPU second. It computes the convex hull of the 7-d hypercube in two CPU seconds. This is a big package with many options.