= Qhull =

== Description ==

From the README.txt of Qhull:

Qhull computes convex hulls, Delaunay triangulations, Voronoi diagrams,
furthest-site Voronoi diagrams, and halfspace intersections about a point.
It runs in 2-d, 3-d, 4-d, or higher.  It implements the Quickhull algorithm
for computing convex hulls.   Qhull handles round-off errors from floating
point arithmetic.  It can approximate a convex hull.

The program includes options for hull volume, facet area, partial hulls,
input transformations, randomization, tracing, multiple output formats, and
execution statistics.

== SPKG Maintainers ==

 * Marshall Hampton

== Upstream Contact ==

C. Bradford Barber
bradb@shore.net 
or qhull@qhull.org

== Dependencies ==

Can be compiled with Qt support, but the Sage version currently doesn't try to do this.

== License ==

Not a standard license, but Sage compatible.  See the COPYING.txt file in the source directory for details.

== Changelog ==

=== qhull-2010.1 ===
 * first attempt by Marshall Hampton