path: root/science/qhull/DETAILS

           SPELL=qhull
         VERSION=7.2.0
              VX=2015.2
     SOURCE_HASH=sha512:a544f88b5fbabc592fdc4c5533ba58a8f856e018b85128f43d0532a1143123ceb0d5ca9ae1d27722efa5d08092c017bf7715c157d1019f447e6746f23f02dcd4
          SOURCE=$SPELL-${VX//.?}-src-$VERSION.tgz
SOURCE_DIRECTORY=$BUILD_DIRECTORY/$SPELL-$VX
   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