How to Install and Uninstall libmath-convexhull-perl Package on Ubuntu 16.04 LTS (Xenial Xerus)

Last updated: December 23,2024

1. Install "libmath-convexhull-perl" package

Please follow the step by step instructions below to install libmath-convexhull-perl on Ubuntu 16.04 LTS (Xenial Xerus)


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                libmath-convexhull-perl
            
                    
    
    Copied

2. Uninstall "libmath-convexhull-perl" package

This guide covers the steps necessary to uninstall libmath-convexhull-perl on Ubuntu 16.04 LTS (Xenial Xerus):


    
        
            $
        

        
            
                sudo apt remove
            
                        
                libmath-convexhull-perl
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the libmath-convexhull-perl package on Ubuntu 16.04 LTS (Xenial Xerus)

Package: libmath-convexhull-perl
Priority: optional
Section: universe/perl
Installed-Size: 52
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Perl Group
Architecture: all
Version: 1.4-1
Depends: perl
Filename: pool/universe/libm/libmath-convexhull-perl/libmath-convexhull-perl_1.4-1_all.deb
Size: 8408
MD5sum: 3dace47cb9f1d094cdfb80fdffc37d17
SHA1: e9ab31c0580d24d80f8720b7f57774fd427203ea
SHA256: 3e7fed75ddc948c5be0663f655da8306f9a3358505815db372c0affa924c44dd
Description-en: Perl module to calculate convex hulls using Graham's scan (n*log(n))
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.
.
The implementation cannot deal with duplicate points. Therefore, points which
are very, very close (think floating point close) to the previous point are
dropped since version 1.02 of the module. However, if you pass in randomly
ordered data which contains duplicate points, this safety measure might not
help you. In that case, you will have to remove duplicates yourself.
Description-md5: a02a323f887a3c86ec26ef2e87a912c6
Homepage: http://search.cpan.org/dist/Math-ConvexHull/
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Origin: Ubuntu