Qhull¶
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
Availability¶
| Module | Manneback | Lemaitre4 |
|---|---|---|
| Qhull/2019.1-GCCcore-8.3.0 | √ | |
| Qhull/2020.2-GCCcore-11.2.0 | √ | √ |
| Qhull/2020.2-GCCcore-11.3.0 | √ | |
| Qhull/2020.2-GCCcore-12.2.0 | √ | |
| Qhull/2020.2-GCCcore-12.3.0 | √ | √ |
| Qhull/2020.2-GCCcore-13.2.0 | √ | √ |