Qhull

Computes convex hulls, Delaunay triangulations, halfspace intersections about a point, Voronoi diagrams.

Qhull is a general dimension convex hull software that reads a set of points from stdin, and then outputs the smallest convex set that contains the points to stdout.

Qhull computes the convex hulls, Delaunay triangulations, halfspace intersections about a point, Voronoi diagrams, furthest-site Delaunay triangulations, and furthest-site Voronoi diagrams.

Qhull runs in 2-d, 3-d, 4-d, and higher dimensions. It implements the Quickhull algorithm for computing the convex hull. Qhull handles roundoff errors from floating point arithmetic. It can approximate a convex hull.

Qhull does not support constrained Delaunay triangulations, triangulation of non-convex surfaces, mesh generation of non-convex objects, or medium-sized inputs in 9-D and higher.

Filed under

Convex hull Delaunay triangulation Halfspace intersection Convex Hull Delaunay Voronoi

Download Hubs

Qhull is part of these download collections: Trigonometry Calculators