Computing convex hulls, Delaunay triangulations and Voronoi diagrams
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.
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.
- Developed at science
- Sources inherited from project openSUSE:Factory
-
4
derived packages
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout openSUSE:Factory:zSystems/qhull && cd $_ - Create Badge
Refresh
Refresh
Source Files
| Filename | Size | Changed |
|---|---|---|
| qhull-2011.1.tar.bz2 | 0000552278 539 KB | |
| qhull.changes | 0000001079 1.05 KB | |
| qhull.spec | 0000004993 4.88 KB |
Revision 4 (latest revision is 23)
Sascha Peilicke (saschpe)
accepted
request 83803
from
Ismail Dönmez (namtrac)
(revision 4)
- updated to 2011.1:
* Remove deprecated libqhull/qhull.h. Use libqhull/libqhull.h instead.
* QhullFacet: Added isSimplicial, isTopOrient, isTriCoplanar, isUpperDelaunay
* Added Qhull::defineVertexFacetNeighbors() for facetNeighbors of vertices.
Automatically called for facet merging and Voronoi diagrams
Do not print QhullVertex::facetNeighbors is !facetNeighborsDefined()
* Add Fixup identifiers
* QhullError: Add copy constructor, assignment operator, and destructor
* Add throw() specifiers to RoadError and QhullError
* Renamed RoadError::defined() to RoadError::isDefined()
* Add #error to Qhull.h if qh_QHpointer is not defined
* etc. see Changes.txt (forwarded request 83793 from pgajdos)
Comments 0