           SPELL=qhull
         VERSION=2003.1
          SOURCE=$SPELL-$VERSION-src.tgz
SOURCE_DIRECTORY=$BUILD_DIRECTORY/$SPELL-$VERSION
   SOURCE_URL[0]=http://www.qhull.org/download/$SOURCE
     SOURCE_HASH=sha512:98c384a54cb2cfcf1e3cf2d040617e22190bac5324e00e3456612d36fec0fe09260f37f10acc7c5af7e71ff7d0549f9910edee8e63b7945e768a3652bef42e0c
        WEB_SITE=http://www.qhull.org/
         ENTERED=20041114
      LICENSE[0]=GPL
        KEYWORDS="science"
           SHORT="Qhull computes convex hulls, Delaunay triangulations, halfspace intersections about a point, Voronoi diagrams, furthest-site Delaunay triangulations, and furthest-site Voronoi diagrams."
cat << EOF
Qhull computes convex hulls, Delaunay triangulations, halfspace intersections about a point, Voronoi diagrams, furthest-site Delaunay triangulations, and furthest-site Voronoi diagrams. It runs in 2-d, 3-d, 4-d, and higher dimensions. It implements the Quickhull algorithm for computing the convex hull. Qhull handles roundoff errors from floating point arithmetic. It can approximate a convex hull.
EOF
