How to Install and Uninstall perl-Math-ConvexHull-MonotoneChain Package on openSuSE Tumbleweed
Last updated: December 25,2024
1. Install "perl-Math-ConvexHull-MonotoneChain" package
Please follow the guidance below to install perl-Math-ConvexHull-MonotoneChain on openSuSE Tumbleweed
$
sudo zypper refresh
Copied
$
sudo zypper install
perl-Math-ConvexHull-MonotoneChain
Copied
2. Uninstall "perl-Math-ConvexHull-MonotoneChain" package
This guide let you learn how to uninstall perl-Math-ConvexHull-MonotoneChain on openSuSE Tumbleweed:
$
sudo zypper remove
perl-Math-ConvexHull-MonotoneChain
Copied
3. Information about the perl-Math-ConvexHull-MonotoneChain package on openSuSE Tumbleweed
Information for package perl-Math-ConvexHull-MonotoneChain:
-----------------------------------------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : perl-Math-ConvexHull-MonotoneChain
Version : 0.01-3.40
Arch : x86_64
Vendor : openSUSE
Installed Size : 17.7 KiB
Installed : No
Status : not installed
Source package : perl-Math-ConvexHull-MonotoneChain-0.01-3.40.src
Upstream URL : http://search.cpan.org/dist/Math-ConvexHull-MonotoneChain/
Summary : Andrew's monotone chain algorithm for finding a convex hull in 2D
Description :
This is somewhat experimental still.
This (XS) module optionally exports a single function 'convex_hull' which
calculates the convex hull of the input points and returns it. The
algorithm is 'O(n log n)' due to having to sort the input list, but should
be somewhat faster than a plain Graham's scan (also 'O(n log n)') in
practice since it avoids polar coordinates.
-----------------------------------------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : perl-Math-ConvexHull-MonotoneChain
Version : 0.01-3.40
Arch : x86_64
Vendor : openSUSE
Installed Size : 17.7 KiB
Installed : No
Status : not installed
Source package : perl-Math-ConvexHull-MonotoneChain-0.01-3.40.src
Upstream URL : http://search.cpan.org/dist/Math-ConvexHull-MonotoneChain/
Summary : Andrew's monotone chain algorithm for finding a convex hull in 2D
Description :
This is somewhat experimental still.
This (XS) module optionally exports a single function 'convex_hull' which
calculates the convex hull of the input points and returns it. The
algorithm is 'O(n log n)' due to having to sort the input list, but should
be somewhat faster than a plain Graham's scan (also 'O(n log n)') in
practice since it avoids polar coordinates.