QHULL

Introduction

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.

Web Page

Official website

Versions

2015.2

Flavours

1

Architecture

x86_64

Group
module load site-local
Build Details

Compiled with:

Without Qt.

Usage
module load qhull/2015.2/1
Example Job Scripts

None yet.

Status

Basic self-tests run.