Monotone chain algorithm for finding a convex hull in 2D
This is somewhat experimental still. This (XS) module optionally exports a single function C<convex_hull> which calculates the convex hull of the input points and returns it. The algorithm is C<O(n log n)> due to having to sort the input list, but should be somewhat faster than a plain Graham's scan (also C<O(n log n)>) in practice since it avoids polar coordinates.
Release | Stable | Testing |
---|---|---|
Fedora Rawhide | 0.01-39.fc40 | - |
Fedora 40 | 0.01-39.fc40 | - |
Fedora 39 | 0.01-37.fc39 | - |
Fedora 38 | 0.01-35.fc38 | - |
You can contact the maintainers of this package via email at
perl-Math-ConvexHull-MonotoneChain dash maintainers at fedoraproject dot org
.