Qhull 2003.1
Qhull is a mathematical software (geometry) that was designed to help you compute convex hulls, Delaunay triangulations, halfspace intersections about a point, Voronoi diagrams, furthest-site Delaunay triangulations, and furthest-site Voronoi diagrams.
|
0.00 
Freeware
0K
Windows Vista 
Qhull is a mathematical software (geometry) that was designed to help you compute convex hulls, Delaunay triangulations, halfspace intersections about a point, Voronoi diagrams, furthest-site Delaunay triangulations, and furthest-site Voronoi diagrams.
It 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.
tags
delaunay triangulations hull qhull non convex convex hull and higher voronoi diagrams furthest site
RSS