# The math/qhull port

## qhull-2011.1 – computing the convex hull

## Description

    Qhull computes 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 computes volumes, surface areas, and
    approximations to the convex hull.

WWW: http://www.qhull.org/

Categories:
  math

## Library dependencies

## Build dependencies

- STEM->=1.5.1:devel/ninja
- STEM->=3.1.3:devel/cmake

## Run dependencies