How to Install and Uninstall libqhull7-7_2_0 Package on openSUSE Leap
Last updated: November 07,2024
Deprecated! Installation of this package may no longer be supported.
1. Install "libqhull7-7_2_0" package
Here is a brief guide to show you how to install libqhull7-7_2_0 on openSUSE Leap
$
sudo zypper refresh
Copied
$
sudo zypper install
libqhull7-7_2_0
Copied
2. Uninstall "libqhull7-7_2_0" package
Please follow the guidance below to uninstall libqhull7-7_2_0 on openSUSE Leap:
$
sudo zypper remove
libqhull7-7_2_0
Copied
3. Information about the libqhull7-7_2_0 package on openSUSE Leap
Information for package libqhull7-7_2_0:
----------------------------------------
Repository : Main Repository
Name : libqhull7-7_2_0
Version : 2015.2-bp153.1.30
Arch : x86_64
Vendor : openSUSE
Installed Size : 1,2 MiB
Installed : No
Status : not installed
Source package : qhull-2015.2-bp153.1.30.src
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 : Main Repository
Name : libqhull7-7_2_0
Version : 2015.2-bp153.1.30
Arch : x86_64
Vendor : openSUSE
Installed Size : 1,2 MiB
Installed : No
Status : not installed
Source package : qhull-2015.2-bp153.1.30.src
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.