NAME

Math::Polygon::Convex - Collection of convex algorithms

INHERITANCE

 Math::Polygon::Convex
   is a 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, http://geometryalgorithms.com/Archive/algorithm_0109/algorithm_0109.htm

SEE ALSO

This module is part of Math-Polygon distribution version 1.01, built on May 25, 2009. Website: http://perl.overmeer.net/geo/

LICENSE

Copyrights 2004,2006-2009 by Mark Overmeer. For other contributors see ChangeLog.

This program is free software; you can redistribute it and/or modify it under the same terms as Perl itself. See http://www.perl.com/perl/misc/Artistic.html