This is a 3D implementation of QuickHull for Java, based on the original paper by Barber, Dobkin, and Huhdanpaa and the C implementation known as qhull. The algorithm has O(n log(n)) complexity, works with double precision numbers, is fairly robust with respect to degenerate situations, and allows the merging of co-planar faces.

Scope:
Scope:
Format:
Scope:
Scope:
Scope:
Scope:
Scope:
Scope:

Licenses

LicenseURL
GNU LESSER GENERAL PUBLIC LICENSE (LGPL) version 3 http://www.gnu.org/licenses/lgpl-3.0-standalone.html

Developers

NameEmailDev IdRolesOrganization
John E. LloydlloydDeveloper
Richard van Nieuwenhovenritchie [at] gmx [dot] atritchie_gmx_atDeveloper