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.
| Uploaded | Mon Mar 31 02:01:36 2025 |
| md5 checksum | f24ea027e3d07ac46e4f4b635635fedc |
| arch | x86_64 |
| build | hdb19cb5_2 |
| build_number | 2 |
| depends | libgcc-ng >=11.2.0, libstdcxx-ng >=11.2.0 |
| license | Qhull |
| license_family | Other |
| md5 | f24ea027e3d07ac46e4f4b635635fedc |
| name | qhull |
| platform | linux |
| sha1 | 119d28ca393a2ea0356704b3c1d98cf0a806f6e1 |
| sha256 | 9511841684e7cdf488738ef1edad812a1c860ec9b85cefcaa9e9290318cb2037 |
| size | 1106088 |
| subdir | linux-64 |
| timestamp | 1670915839713 |
| version | 2020.2 |