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.
homepage: http://www.qhull.org
| version | toolchain |
|---|---|
2015.2 |
GCCcore/5.4.0 |
2015.2 |
GCCcore/6.3.0 |
2015.2 |
GCCcore/6.4.0 |
2015.2 |
GCCcore/7.3.0 |
2015.2 |
foss/2016a |
2015.2 |
foss/2016b |
2015.2 |
foss/2017b |
2015.2 |
intel/2016a |
2015.2 |
intel/2016b |
2015.2 |
intel/2017a |
2019.1 |
GCCcore/8.2.0 |
2019.1 |
GCCcore/8.3.0 |
2020.2 |
GCCcore/10.2.0 |
2020.2 |
GCCcore/10.3.0 |
2020.2 |
GCCcore/11.2.0 |
2020.2 |
GCCcore/11.3.0 |
2020.2 |
GCCcore/12.2.0 |
2020.2 |
GCCcore/12.3.0 |
2020.2 |
GCCcore/13.2.0 |
2020.2 |
GCCcore/13.3.0 |
(quick links: (all) - 0 - a - b - c - d - e - f - g - h - i - j - k - l - m - n - o - p - q - r - s - t - u - v - w - x - y - z)