Computing convex hulls, Delaunay triangulations and Voronoi diagrams

Edit Package qhull

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.

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.

  • Sources inherited from project openSUSE:13.1
  • Download package
  • osc -A checkout openSUSE:13.1:Update/qhull && cd $_
  • Create Badge
Source Files
Filename Size Changed
qhull-2012.1-src.tgz 0000716665 700 KB about 11 years
qhull.changes 0000002893 2.83 KB over 9 years
qhull.spec 0000005062 4.94 KB over 9 years
Comments 0
openSUSE Build Service is sponsored by