SAL Home MATH Misc


Icon Qhull is a general dimension code for computing convex hulls, Delaunay triangulations, Voronoi vertices, furthest-site Voronoi vertices, and halfspace intersections. It implements the Quickhull algorithm for computing the convex hull. Qhull handles round-off errors from floating point arithmetic. It can approximate a convex hull.

Current Version:   2.5

License Type:

Home Site:

Source Code Availability:


Available Binary Packages:

  • Debian Package: No
  • RedHat RPM Package: No
  • Other Packages: No

Targeted Platforms:

Unix, Power Macs, Win32.

Software/Hardware Requirements:

Version 2 should compile on all ANSI C compilers with 32-bit or 64-bit integers.

Other Links:

Mailing Lists/USENET News Groups:


User Comments:

  • Barber, C.B., Dobkin, D.P., Huhdanpaa, H., "The Quickhull algorithm for convex hulls," ACM Transactions on Mathematical Software, Vol.22, No. 4 (Dec. 1996), pp. 469-483, Abstract.

See A Screen Shot?

  SAL Home   |   Mathematics   |   Misc

Comments? SAL@KachinaTech.COM
Copyright © 1995-2001 by Herng-Jeng Jou
Copyright © 1997-2001 by Kachina Technologies, Inc.
All rights reserved.