Qhull

Qhull computes the convex hull, Delaunay triangulation, Voronoi diagram, halfspace intersection about a point, furthest-site Delaunay triangulation, and furthest-site Voronoi diagram. The source code runs in 2-d, 3-d, 4-d, and higher dimensions. Qhull implements the Quickhull algorithm for computing the convex hull.

More Information

For more information visit the Qhull website.

Available Versions

These versions of Qhull are available on the BEAR systems (BlueBEAR and BEAR Cloud VMs). These will be retained in accordance with our Applications Support and Retention Policy.

Version	BEAR Apps Version
2020.2-GCCcore-12.3.0	2023a
2020.2-GCCcore-12.2.0	2022b
2020.2-GCCcore-11.3.0	2022a
2020.2-GCCcore-11.2.0	2021b
2020.2-GCCcore-10.3.0	2021a
2015.2-GCCcore-7.3.0	2018b