science/qhull/DETAILS


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19

           SPELL=qhull
         VERSION=2012.1
     SOURCE_HASH=sha512:e35ea2cb73ef32b23b64a6594a8b5ea22ed8e2ea7535cfd72dca44331602368dfcb681600a0d2b090e80e67e6be7b32272244b9083d4805f2fbcf5897eb73240
          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