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
| Compiler/MPI | GCC 8.3.1 | GCC 9.3.0 | Intel 19.0.3 | Intel 20.0.3 | OneAPI 2021.3.0 |
|---|
| MPICH 3.3.2 |
|
|
|
|
|
|---|
| MVAPICH2 2.3.4 |
|
|
|
|
|
|---|
| OpenMPI 4.0.5 |
|
|
|
|
|
|---|
| Code Block |
|---|
| language | bash |
|---|
| title | Example |
|---|
| collapse | true |
|---|
|
|
Links
For more information vist
Image Added