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.
http://www.qhull.org
Available modules¶
The overview below shows which Qhull installations are available per target architecture in EESSI, ordered based on software version (new to old).
To start using Qhull, load one of these modules using a module load command like:
(This data was automatically generated on Fri, 06 Feb 2026 at 13:12:13 UTC)
| aarch64/generic | aarch64/a64fx | aarch64/neoverse_n1 | aarch64/neoverse_v1 | aarch64/nvidia/grace | x86_64/generic | x86_64/amd/zen2 | x86_64/amd/zen3 | x86_64/amd/zen4 | x86_64/intel/cascadelake | x86_64/intel/haswell | x86_64/intel/icelake | x86_64/intel/sapphirerapids | x86_64/intel/skylake_avx512 | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Qhull/2020.2-GCCcore-13.2.0 | x | x | x | x | x | x | x | x | x | x | x | x | x | x |
| Qhull/2020.2-GCCcore-12.3.0 | x | x | x | x | x | x | x | x | x | x | x | x | x | x |
| Qhull/2020.2-GCCcore-12.2.0 | x | x | x | x | x | x | x | x | x | x | x | x | x | x |