libmath-convexhull-monotonechain-perl
Perl module to calculate a convex hull using Andrew's monotone chain algorithm
Description
Math::ConvexHull::MonotoneChain optionally exports a single function convex_hull which calculates the convex hull of the input points and returns it. Andrew's monotone chain convex hull algorithm constructs the convex hull of a set of 2-dimensional points in O(n*log(n)) time. It does so by first sorting the points lexicographically (first by x-coordinate, and in case of a tie, by y-coordinate), and then constructing upper and lower hulls of the points in O(n) time. It should be somewhat faster than a plain Graham's scan (also O(n*log(n))) in practice since it avoids polar coordinates.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 screenshotHint: upload an image here from your clipboard with Ctrl-V
Homepage
https://metacpan.org/release/Math-ConvexHull-MonotoneChain/
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-monotonechain-perl