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.
Available modules
The overview below shows which Qhull installations are available per target architecture in the HPCC module system, ordered based on software version (new to old).
To start using Qhull, load one of these modules using a module load command like:
1 | |
(This data was automatically generated on Thu, 17 Apr 2025 at 12:00:12 EDT)
| neoverse_v1 | generic | zen2 | zen3 | zen4 | haswell | skylake_avx512 | |
|---|---|---|---|---|---|---|---|
| Grace Nodes | everywhere (except Grace nodes) | amd20 | amd22 | amd24 | intel16 | intel18,amd20-v100,amd21,intel21 | |
| Qhull/2020.2-GCCcore-13.2.0 | - | x | - | - | - | x | - |
| Qhull/2020.2-GCCcore-12.3.0 | - | x | - | - | - | x | - |
| Qhull/2020.2-GCCcore-12.2.0 | - | x | - | - | - | x | - |
| Qhull/2020.2-GCCcore-11.3.0 | - | - | - | - | - | x | x |