          MODULE=qhull
         VERSION=2020.2
          SOURCE=$MODULE-$VERSION.tar.gz
 SOURCE_URL_FULL=https://github.com/qhull/qhull/archive/refs/tags/$VERSION.tar.gz
SOURCE_DIRECTORY=$BUILD_DIRECTORY/qhull-2020.2
      SOURCE_VFY=sha256:59356b229b768e6e2b09a701448bfa222c37b797a84f87f864f97462d8dbc7c5
        WEB_SITE=http://www.qhull.org/
         ENTERED=20100125
         UPDATED=20210421
           SHORT="computing convex hulls"

cat << EOF
Qhull is a general dimension code for computing convex hulls, Delaunay
triangulations, halfspace intersections about a point, Voronoi diagrams,
furthest-site Delaunay triangulations, and furthest-site Voronoi diagrams.
These structures have applications in science, engineering, statistics, and
mathematics. For a detailed introduction, see O'Rourke ['94], Computational
Geometry in C.
EOF
