qhull (math/qhull) Add to my watchlist
Programs and library for computing convex hulls.Qhull computes the convex hull, Delaunay triangulation, Voronoi diagram, halfspace intersection about a point, furthest-site Delaunay triangulation, and furthest-site Voronoi diagram. The software 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. Qhull also computes volumes, surface areas, and approximations to the convex hull.
Version: 2020.2 License: Permissive GitHubStatistics for selected duration
2024-Oct-06 to 2024-Nov-05
Total Installations | 205 |
---|---|
Requested Installations | 12 |
Loading Chart
Loading Chart
Loading Chart
Loading Chart
Variants | Count |
---|
Monthly Statistics
Can remain cached for up to 24 hours
Loading Chart
Percentage of installations per version per month
Loading Chart