1 Math::ConvexHull is a simple module that calculates convex hulls from a
2 set of points in 2D space. It is a straightforward implementation of the
3 algorithm known as Graham's scan which, with complexity of O(n*log(n)),
4 is the fastest known method of finding the convex hull of an arbitrary
5 set of points. There are some methods of eliminating points that cannot
6 be part of the convex hull. These may or may not be implemented in a
9 WWW: http://search.cpan.org/dist/Math-ConvexHull/