           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
          MD5[0]=3d80fa3800532e65a2450ee92c2617df
        WEB_SITE=http://www.qhull.org/
         ENTERED=20041114
         UPDATED=20041114
       BUILD_API=2
      LICENSE[0]=GPL
      MAINTAINER=d.malcolm@auckland.ac.nz
           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
