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. It handles roundoff errors from floating point arithmetic. It computes volumes, surface areas, and approximations to the convex hull.

Usage

Versionmodule name
2020.1qhull/2020.1
Compiler/MPIGCC 8.3.1GCC 9.3.0Intel 19.0.3Intel 20.0.3Intel 2021.3.0
Serial
Example
 

For more information vist