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. (Source: https://github.com/easybuilders/easybuild-easyconfigs )
Locations and versions:
Major 2015
2015.2 TU Dresden
Missing a specific version? Write us a message.