Provided by: libmath-polygon-perl_2.00-1_all 

NAME
Math::Polygon::Convex - Collection of convex algorithms
INHERITANCE
Math::Polygon::Convex
is an Exporter
SYNOPSIS
use Math::Polygon::Convex qw/chainHull_2D/;
my @points = ( [1,2], [2,4], [5,7], [1,2] );
my $poly = chainHull_2D @points;
DESCRIPTION
The "convex polygon" around a set of points, is the polygon with a minimal size which contains all
points.
This package contains one convex calculation algorithm, but may be extended with alternative
implementations in the future.
FUNCTIONS
chainHull_2D(@points)
Each POINT is an ARRAY of two elements: the X and Y coordinate of a point. Returned is the enclosing
convex Math::Polygon object.
Algorithm by Dan Sunday, <https://geometryalgorithms.com/Archive/algorithm_0109/algorithm_0109.htm>
SEE ALSO
This module is part of Math-Polygon version 2.00, built on September 04, 2025. Website:
http://perl.overmeer.net/CPAN/
LICENSE
For contributors see file ChangeLog.
This software is copyright (c) 2004-2025 by Mark Overmeer.
This is free software; you can redistribute it and/or modify it under the same terms as the Perl 5
programming language system itself.
perl v5.40.1 2025-10-04 Math::Polygon::Convex(3pm)