How to Install and Uninstall qhull Package on openSuSE Tumbleweed
Last updated: November 23,2024
1. Install "qhull" package
Please follow the guidance below to install qhull on openSuSE Tumbleweed
$
sudo zypper refresh
Copied
$
sudo zypper install
qhull
Copied
2. Uninstall "qhull" package
This tutorial shows how to uninstall qhull on openSuSE Tumbleweed:
$
sudo zypper remove
qhull
Copied
3. Information about the qhull package on openSuSE Tumbleweed
Information for package qhull:
------------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : qhull
Version : 2020.2-4.1
Arch : x86_64
Vendor : openSUSE
Installed Size : 1.1 MiB
Installed : No
Status : not installed
Source package : qhull-2020.2-4.1.src
Upstream URL : http://www.qhull.org
Summary : Computing convex hulls, Delaunay triangulations and Voronoi diagrams
Description :
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.
------------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : qhull
Version : 2020.2-4.1
Arch : x86_64
Vendor : openSUSE
Installed Size : 1.1 MiB
Installed : No
Status : not installed
Source package : qhull-2020.2-4.1.src
Upstream URL : http://www.qhull.org
Summary : Computing convex hulls, Delaunay triangulations and Voronoi diagrams
Description :
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.