Math::ConvexHull

Current version is 1.03.

Download

README

Math::ConvexHull
================

Math::ConvexHull is a simple module that calculates convex hulls from
a set of points in 2D space. It is a straightforward implementation
of the algorithm known as Graham's scan which, with complexity of
O(n*log(n)), is the fastest known method of finding the convex hull
of an arbitrary set of points. There are some methods of eliminating
points that cannot be part of the convex hull. These may or may not
be implemented in a future version.

INSTALLATION

To install this module type the following:

   perl Makefile.PL
   make
   make test
   make install

DEPENDENCIES

This module requires these other modules and libraries:

  Test::More

SEE ALSO

New versions of this module may be found on http://steffen-mueller.net or
on CPAN.

COPYRIGHT AND LICENCE

Copyright (C) 2003-2007 Steffen Mueller 

This library is free software; you can redistribute it and/or modify
it under the same terms as Perl itself.

Documentation

Math::ConvexHull

Change Log

Revision history for Perl extension Math::ConvexHull.

1.03  Thu May 29 14:24 2008
        - Document that you can actually break the implementation
          by passing in randomly ordered data with duplicates.
          Don't do that! (Thanks to Anton Berezin!)

1.02  Thu Sep 06 11:39 2007
        - Fixed bug with duplicate points. (Thanks to John Harvey!)

1.01  Fri Jun 30 21:25 2006
	- Distribution upgrade:
	--> Added META.yml
	--> Added t/ and moved test.pl
	--> Added POD tests.

1.00  Sat Jul 26 15:46 2003
	- original version as uploaded to CPAN