Monotone chain algorithm for finding a convex hull in 2D
built by guoguo
completed Fri, 16 Oct 2026 21:43:57 UTC
Description
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.
RPMs
4 files, 2 archessrc
riscv64
Logs
riscv64
Changelog
* Wed Jul 22 2026 Jitka Plesnikova <jplesnik@redhat.com> - 0.01-47 - Perl 5.44 rebuild * Thu Jul 16 2026 Fedora Release Engineering <releng@fedoraproject.org> - 0.01-46 - Rebuilt for https://fedoraproject.org/wiki/Fedora_45_Mass_Rebuild * Sat Jan 17 2026 Fedora Release Engineering <releng@fedoraproject.org> - 0.01-45 - Rebuilt for https://fedoraproject.org/wiki/Fedora_44_Mass_Rebuild * Fri Jul 25 2025 Fedora Release Engineering <releng@fedoraproject.org> - 0.01-44 - Rebuilt for https://fedoraproject.org/wiki/Fedora_43_Mass_Rebuild * Mon Jul 07 2025 Jitka Plesnikova <jplesnik@redhat.com> - 0.01-43 - Perl 5.42 rebuild * Sat Jan 18 2025 Fedora Release Engineering <releng@fedoraproject.org> - 0.01-42 - Rebuilt for https://fedoraproject.org/wiki/Fedora_42_Mass_Rebuild