qhull
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 2D 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.
Není dostupný žádný oficiální balíček pro openSUSE Leap 15.5Distribuce
openSUSE Tumbleweed
openSUSE Slowroll
openSUSE Leap 15.6
openSUSE Leap 15.5
openSUSE Leap 15.4
SUSE SLE-15-SP2
SUSE SLE-15-SP1
CentOS CentOS-7