1 <?xml version="1.0" encoding="UTF-8"?>
2 <!DOCTYPE pkgmetadata SYSTEM "https://www.gentoo.org/dtd/metadata.dtd">
4 <herd>sci-mathematics</herd>
5 <longdescription lang="en">
6 Qhull computes the convex hull, Delaunay triangulation, Voronoi
7 diagram, halfspace intersection about a point, furthest-site
8 Delaunay triangulation, and furthest-site Voronoi diagram. The
9 source code runs in 2-d, 3-d, 4-d, and higher dimensions. Qhull
10 implements the Quickhull algorithm for computing the convex hull. It
11 handles roundoff errors from floating point arithmetic. It computes
12 volumes, surface areas, and approximations to the convex hull.
13 Qhull does not support constrained Delaunay triangulations,
14 triangulation of non-convex surfaces, mesh generation of non-convex
15 objects, or medium-sized inputs in 9-D and higher.