libmath-convexhull-perl

Perl module to calculate convex hulls using Graham's scan (n*log(n))

Description

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.

The implementation cannot deal with duplicate points. Therefore, points which are very, very close (think floating point close) to the previous point are dropped since version 1.02 of the module. However, if you pass in randomly ordered data which contains duplicate points, this safety measure might not help you. In that case, you will have to remove duplicates yourself.

Upload more screenshots

Please help extend the collection of screenshots. Just make a screenshot and upload it here. You don't need to register or anything.

Upload a screenshot

Hint: upload an image here from your clipboard with Ctrl-V


Homepage

http://search.cpan.org/dist/Math-ConvexHull/


Install this software package

If the package is available for the distribution you are currently using on your computer then install the software by clicking on…

Install libmath-convexhull-perl

Cookies help us deliver our services. By using our services, you agree to our use of cookies. Learn more