Qhull
- Abstract
- Qhull computes convex hulls, Delaunay triangulations, halfspace intersections, 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.
Qhull does not support constrained Delaunay triangulations, triangulation of non-convex surfaces, mesh generation of non-convex objects, or medium-sized inputs in 9-D and higher.
- DateOfInformation
- Fri Jul 24 11:49:27 1998
- Domain
- Grid Generation!Triangular
- Name
- Qhull
- TargetEnvironment
- Windows. Install Geomview if you are running SGI Irix, Solaris, SunOS, Linux, HP, IBM RS/6000, DEC Alpha, or Next. You can then visualize the output of Qhull.
- TitleLine
- a general dimension code for computing convex hulls, Delaunay triangulations, halfspace intersections, Voronoi diagrams, furthest-site Delaunay triangulations, and furthest-site Voronoi diagrams
- Version
- 2.5
- VersionDate
- May 1998
- Webpage
- http://www.geom.umn.edu/software/qhull/
- ContactIs
- Qhull Help
Meta Data URL from which this entry was created:
http://www.nhse.org/rib/repositories/CEWES_Grid_Gen/objects/Asset/qhull.html
nhse-tech@nhse.org