Package Info

qhull


Computing convex hulls, Delaunay triangulations and Voronoi diagrams


Development/Libraries/C and C++

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 2D 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.


License: Qhull
URL: http://www.qhull.org

Categories

Releases

Package Version Update ID Released Package Hub Version Platforms Subpackages
2015.2-bp150.1.2 info GA Release 2018-07-30 15
  • AArch64
  • ppc64le
  • s390x
  • x86-64
  • libqhull7-7_2_0
  • qhull
  • qhull-devel
2015.2-bp151.1.1 info GA Release 2019-07-17 15 SP1
  • AArch64
  • ppc64le
  • s390x
  • x86-64
  • libqhull7-7_2_0
  • qhull
  • qhull-devel
2015.2-bp152.3.27 info GA Release 2020-04-16 15 SP2
  • AArch64
  • ppc64le
  • s390x
  • x86-64
  • libqhull7-7_2_0
  • qhull
  • qhull-devel
2015.2-bp153.1.30 info GA Release 2021-03-05 15 SP3
  • AArch64
  • ppc64le
  • s390x
  • x86-64
  • libqhull7-7_2_0
  • qhull
  • qhull-devel