How to Install and Uninstall libmath-convexhull-monotonechain-perl Package on Ubuntu 21.04 (Hirsute Hippo)

Last updated: May 02,2024

1. Install "libmath-convexhull-monotonechain-perl" package

This guide let you learn how to install libmath-convexhull-monotonechain-perl on Ubuntu 21.04 (Hirsute Hippo)

$ sudo apt update $ sudo apt install libmath-convexhull-monotonechain-perl

2. Uninstall "libmath-convexhull-monotonechain-perl" package

Learn how to uninstall libmath-convexhull-monotonechain-perl on Ubuntu 21.04 (Hirsute Hippo):

$ sudo apt remove libmath-convexhull-monotonechain-perl $ sudo apt autoclean && sudo apt autoremove

3. Information about the libmath-convexhull-monotonechain-perl package on Ubuntu 21.04 (Hirsute Hippo)

Package: libmath-convexhull-monotonechain-perl
Architecture: amd64
Version: 0.1-1build8
Priority: optional
Section: universe/perl
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Perl Group
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 40
Depends: perl (>= 5.32.0-4), perlapi-5.32.0, libc6 (>= 2.2.5)
Filename: pool/universe/libm/libmath-convexhull-monotonechain-perl/libmath-convexhull-monotonechain-perl_0.1-1build8_amd64.deb
Size: 8724
MD5sum: 13176d975fffc378284d501626260cc2
SHA1: bb73beb7517734bd012cba6c52978d10feb83e2b
SHA256: ae01767daaaa95adc02eac786b161f7ebfa2690f1bb2110dc4983b2001f33af2
SHA512: 8286d76340379eb74fa7b3b229e5f31ab08d65cff516bd7fdf47afe8c79b91c20130bce3a45c9da00831adf339f4ad43dac1375628c73fd36fe653284e28395a
Homepage: https://metacpan.org/release/Math-ConvexHull-MonotoneChain/
Description-en: Perl module to calculate a convex hull using Andrew's monotone chain algorithm
Math::ConvexHull::MonotoneChain optionally exports a single function
convex_hull which calculates the convex hull of the input points and returns
it. Andrew's monotone chain convex hull algorithm constructs the convex hull
of a set of 2-dimensional points in O(n*log(n)) time.
.
It does so by first sorting the points lexicographically (first by
x-coordinate, and in case of a tie, by y-coordinate), and then constructing
upper and lower hulls of the points in O(n) time. It should be somewhat faster
than a plain Graham's scan (also O(n*log(n))) in practice since it avoids polar
coordinates.
Description-md5: 4bb3e9e975532650819a5c71b6067496