qhull-2020.2
computing the convex hull
Back to search · Project homepage
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.
Package information
- Ports path
- math/qhull
- Package architecture
- amd64
- Maintainer
- The OpenBSD ports mailing-list <ports@openbsd.org>
- Categories
- math
- Available flavors
- None listed
These are ports metadata. Binary availability depends on the release, architecture and mirror. Build and test dependencies are not an installation checklist.
Direct dependencies
Build
- devel/cmake/core STEM->=4
- devel/ninja
Used by (8 dependency relationships)
Includes library, runtime, build and test relationships. Results load 100 at a time.