There is a newer version of QhullQhull 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.
Accessing Qhull 2020.2-GCCcore-11.2.0
To load the module for Qhull 2020.2-GCCcore-11.2.0 please use this command on the BEAR systems (BlueBEAR, BEARCloud VMs, and CaStLeS VMs):
module load Qhull/2020.2-GCCcore-11.2.0
BEAR Apps Version
For more information visit the Qhull website.
This version of Qhull has a direct dependency on: GCCcore/11.2.0
This version of Qhull is a direct dependent of: matplotlib/3.4.3-foss-2021b
These versions of Qhull are available on the BEAR systems (BlueBEAR, BEARCloud VMs, and CaStLeS VMs). These will be retained in accordance with our Applications Support and Retention Policy.
|Version||BEAR Apps Version|
Last modified on 24th June 2022