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=2011.1
     SOURCE_HASH=sha512:b08161af2551a0d6b63c9c48925ff5e0d0de7da69c28599d58e9f8c40638666b1a453d208b74d3b6ad6821e1be09d1d2154dbfd8e8982d15bb66d1a97f89b154
          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