How to Install and Uninstall perl-Math-ConvexHull-MonotoneChain.x86_64 Package on Fedora 34
Last updated: October 05,2024
1. Install "perl-Math-ConvexHull-MonotoneChain.x86_64" package
This guide let you learn how to install perl-Math-ConvexHull-MonotoneChain.x86_64 on Fedora 34
$
sudo dnf update
Copied
$
sudo dnf install
perl-Math-ConvexHull-MonotoneChain.x86_64
Copied
2. Uninstall "perl-Math-ConvexHull-MonotoneChain.x86_64" package
This tutorial shows how to uninstall perl-Math-ConvexHull-MonotoneChain.x86_64 on Fedora 34:
$
sudo dnf remove
perl-Math-ConvexHull-MonotoneChain.x86_64
Copied
$
sudo dnf autoremove
Copied
3. Information about the perl-Math-ConvexHull-MonotoneChain.x86_64 package on Fedora 34
Last metadata expiration check: 5:16:32 ago on Tue Sep 6 08:10:37 2022.
Available Packages
Name : perl-Math-ConvexHull-MonotoneChain
Version : 0.01
Release : 29.fc34
Architecture : x86_64
Size : 18 k
Source : perl-Math-ConvexHull-MonotoneChain-0.01-29.fc34.src.rpm
Repository : fedora
Summary : Monotone chain algorithm for finding a convex hull in 2D
URL : https://metacpan.org/release/Math-ConvexHull-MonotoneChain
License : GPL+ or Artistic
Description : This is somewhat experimental still.
:
: This (XS) module optionally exports a single function C
: which calculates the convex hull of the input points and returns it.
: The algorithm is C due to having to sort the input list,
: but should be somewhat faster than a plain Graham's scan (also C)
: in practice since it avoids polar coordinates.
Available Packages
Name : perl-Math-ConvexHull-MonotoneChain
Version : 0.01
Release : 29.fc34
Architecture : x86_64
Size : 18 k
Source : perl-Math-ConvexHull-MonotoneChain-0.01-29.fc34.src.rpm
Repository : fedora
Summary : Monotone chain algorithm for finding a convex hull in 2D
URL : https://metacpan.org/release/Math-ConvexHull-MonotoneChain
License : GPL+ or Artistic
Description : This is somewhat experimental still.
:
: This (XS) module optionally exports a single function C
: which calculates the convex hull of the input points and returns it.
: The algorithm is C
: but should be somewhat faster than a plain Graham's scan (also C
: in practice since it avoids polar coordinates.