2010-05-12 23:27:40 +02:00
|
|
|
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. It implements the Quickhull
|
|
|
|
|
algorithm for computing the convex hull. Qhull handles roundoff errors
|
|
|
|
|
from floating point arithmetic. It computes volumes, surface areas,
|
|
|
|
|
and approximations to the convex hull.
|
|
|
|
|
|
2017-04-23 10:39:04 +02:00
|
|
|
Qhull does not support constrained Delaunay triangulations, triangulation of
|
2010-05-12 23:27:40 +02:00
|
|
|
non-convex surfaces, mesh generation of non-convex objects, or medium-sized
|
2017-04-23 10:39:04 +02:00
|
|
|
inputs in 9-D and higher.
|
2010-05-12 23:27:40 +02:00
|
|
|
|
|
|
|
|
qhull is an optional dependency for the octave package.
|
