           SPELL=qhull
         VERSION=2010.1
     SOURCE_HASH=sha512:aa87a6041f63e05418cefd73109c459909ef5860184496a881a46dc840de9b0182d65a88960ac3bfd1e770e9c64ee554916d02bf30d8039c82b8f8f6a889cc64
          SOURCE=$SPELL-$VERSION-src.tgz
SOURCE_DIRECTORY=$BUILD_DIRECTORY/$SPELL-$VERSION
   SOURCE_URL[0]=http://www.qhull.org/download/$SOURCE
        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
