Math::Polygon::Convex(3pm)

Usage

 use Math::Polygon::Convex  qw/chainHull_2D/;
 my @points = ( [1,2], [2,4], [5,7], [1,2] );
 my $poly   = chainHull_2D @points;

 Math::Polygon::Convex
   is an Exporter

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.

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, http://geometryalgorithms.com/Archive/algorithm_0109/algorithm_0109.htm

8 releases since Debian 6.0 (Squeeze); the text changed 6 times.