Qhull 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:   http://www.geom.umn.edu/software/download/COPYING.html

Home Site: http://www.geom.umn.edu/software/qhull/ Source Code Availability: Yes 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: None Mailing Lists/USENET News Groups: None 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