How to Install and Uninstall perl-Math-ConvexHull.noarch Package on Fedora 39
Last updated: November 28,2024
1. Install "perl-Math-ConvexHull.noarch" package
Here is a brief guide to show you how to install perl-Math-ConvexHull.noarch on Fedora 39
$
sudo dnf update
Copied
$
sudo dnf install
perl-Math-ConvexHull.noarch
Copied
2. Uninstall "perl-Math-ConvexHull.noarch" package
Please follow the steps below to uninstall perl-Math-ConvexHull.noarch on Fedora 39:
$
sudo dnf remove
perl-Math-ConvexHull.noarch
Copied
$
sudo dnf autoremove
Copied
3. Information about the perl-Math-ConvexHull.noarch package on Fedora 39
Last metadata expiration check: 4:42:27 ago on Thu Mar 7 17:44:52 2024.
Available Packages
Name : perl-Math-ConvexHull
Version : 1.04
Release : 32.fc39
Architecture : noarch
Size : 15 k
Source : perl-Math-ConvexHull-1.04-32.fc39.src.rpm
Repository : fedora
Summary : Calculate convex hulls using Graham's scan (n*log(n))
URL : https://metacpan.org/release/Math-ConvexHull
License : GPL-1.0-or-later OR Artistic-1.0-Perl
Description : Math::ConvexHull is a simple module that calculates convex hulls from a set
: of points in 2D space. It is a straightforward implementation of the
: algorithm known as Graham's scan which, with complexity of O(n*log(n)), is
: the fastest known method of finding the convex hull of an arbitrary set of
: points. There are some methods of eliminating points that cannot be part of
: the convex hull. These may or may not be implemented in a future version.
Available Packages
Name : perl-Math-ConvexHull
Version : 1.04
Release : 32.fc39
Architecture : noarch
Size : 15 k
Source : perl-Math-ConvexHull-1.04-32.fc39.src.rpm
Repository : fedora
Summary : Calculate convex hulls using Graham's scan (n*log(n))
URL : https://metacpan.org/release/Math-ConvexHull
License : GPL-1.0-or-later OR Artistic-1.0-Perl
Description : Math::ConvexHull is a simple module that calculates convex hulls from a set
: of points in 2D space. It is a straightforward implementation of the
: algorithm known as Graham's scan which, with complexity of O(n*log(n)), is
: the fastest known method of finding the convex hull of an arbitrary set of
: points. There are some methods of eliminating points that cannot be part of
: the convex hull. These may or may not be implemented in a future version.