qhull: Compute convex hulls, Delaunay triangulations, Voronoi diagrams

Description

From the README.txt of Qhull:

Qhull computes convex hulls, Delaunay triangulations, Voronoi diagrams, furthest-site Voronoi diagrams, and halfspace intersections about a point. It runs in 2-d, 3-d, 4-d, or higher. It implements the Quickhull algorithm for computing convex hulls. Qhull handles round-off errors from floating point arithmetic. It can approximate a convex hull.

The program includes options for hull volume, facet area, partial hulls, input transformations, randomization, tracing, multiple output formats, and execution statistics.

Further notes:

The qhull library is already shipped with the Python library scipy (from version 1.4), see

There is also the Python interface Pyhull available on PyPI https://pypi.python.org/pypi/pyhull (see also documentation at http://pythonhosted.org/pyhull/).

Upstream Contact

  1. Bradford Barber bradb@shore.net or qhull@qhull.org

Dependencies

Can be compiled with Qt support, but the Sage version currently doesn’t try to do this.

License

Not a standard license, but Sage compatible. See the COPYING.txt file in the source directory for details.

Type

optional

Version Information

package-version.txt:

2015-src-7.2.0.p1

Equivalent System Packages

conda:

$ conda install qhull

macports: install the following packages: qhull opensuse:

$ sudo zypper install qhull

See https://repology.org/project/qhull/versions

However, these system packages will not be used for building Sage because spkg-configure.m4 has not been written for this package; see https://trac.sagemath.org/ticket/27330