Qhull
- Axel Keller
Description
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
- Homepage: http://www.qhull.org
Available Versions of Qhull
Version | Module | Available on |
|---|---|---|
2020.2-GCCcore-13.2.0 | math/Qhull/2020.2-GCCcore-13.2.0 | Noctua 2 |
2020.2-GCCcore-12.2.0 | math/Qhull/2020.2-GCCcore-12.2.0 | Noctua 1 |
2020.2-GCCcore-11.3.0 | math/Qhull/2020.2-GCCcore-11.3.0 | Noctua 2 |
2020.2-GCCcore-11.2.0 | math/Qhull/2020.2-GCCcore-11.2.0 | Noctua 2 |
2020.2-GCCcore-10.3.0 | math/Qhull/2020.2-GCCcore-10.3.0 | Noctua 1 |
This table is generated automatically. If you need other versions please click pc2-support@uni-paderborn.de.
Usage Hints for Qhull
If you need support in using this software or example job scripts please click pc2-support@uni-paderborn.de.