How to Install and Uninstall libmath-convexhull-monotonechain-perl Package on Kali Linux

Last updated: February 02,2025

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

In this section, we are going to explain the necessary steps to install libmath-convexhull-monotonechain-perl on Kali Linux


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                libmath-convexhull-monotonechain-perl
            
                    
    
    Copied

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

Please follow the step by step instructions below to uninstall libmath-convexhull-monotonechain-perl on Kali Linux:


    
        
            $
        

        
            
                sudo apt remove
            
                        
                libmath-convexhull-monotonechain-perl
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the libmath-convexhull-monotonechain-perl package on Kali Linux

Package: libmath-convexhull-monotonechain-perl
Source: libmath-convexhull-monotonechain-perl (0.1-2)
Version: 0.1-2+b2
Installed-Size: 42
Maintainer: Debian Perl Group
Architecture: amd64
Depends: perl (>= 5.38.2-2), perlapi-5.38.2, libc6 (>= 2.2.5)
Size: 9120
SHA256: 71cfb4ca8c1de8f91ea468011693f1d7436048265cb14f0c6fae5d74dd57cc24
SHA1: 6af5ead5da9fd32c5b3531e8164fd91d8ba5a468
MD5sum: 56fa14123e3f60f8227ff21136e43a47
Description: 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:
Homepage: https://metacpan.org/release/Math-ConvexHull-MonotoneChain
Tag: devel::lang:perl, devel::library, implemented-in::c,
implemented-in::perl, role::devel-lib
Section: perl
Priority: optional
Filename: pool/main/libm/libmath-convexhull-monotonechain-perl/libmath-convexhull-monotonechain-perl_0.1-2+b2_amd64.deb