=head1 NAME

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

=head1 INHERITANCE

 Math::Polygon::Convex
   is a Exporter

=head1 SYNOPSIS

 use Math::Polygon::Convex  qw/chainHull_2D/;

 my @points = ( [1,2], [2,4], [5,7], [1,2] );
 my $poly   = chainHull_2D @points;

=head1 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.

=head1 FUNCTIONS

=over 4

=item B<chainHull_2D>(POINTS)

Each POINT is an ARRAY of two elements: the X and Y coordinate of a point.
Returned is the enclosing convex L<Math::Polygon|Math::Polygon> object.

Algorithm by Dan Sunday,
F<http://geometryalgorithms.com/Archive/algorithm_0109/algorithm_0109.htm>

=back

=head1 SEE ALSO

This module is part of Math-Polygon distribution version 1.02,
built on September 19, 2011. Website: F<http://perl.overmeer.net/geo/>

=head1 LICENSE

Copyrights 2004,2006-2011 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 F<http://www.perl.com/perl/misc/Artistic.html>