[ascl:1304.016]
Qhull: Quickhull algorithm for computing the convex hull

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.

- Code site:
- http://www.qhull.org/
- Used in:
- http://adsabs.harvard.edu/abs/2004AAS...20516106X
- Described in:
- http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.117.405

- Bibcode:
- 2013ascl.soft04016B

Views: 2009