# 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 |Generic|E5|Lake|Epyc|Cascade|
|------|------|------|------|------|------|
|<a href="qhull.html">Qhull/2020.2-GCCcore-11.2.0</a>|| ✓ ||||