Monotone chain algorithm for finding a convex hull in 2D
17.30 KB
built 2026-10-16 21:43:49 GMT
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.
Dependencies
18 totalRequires15
- libc.so.6()(64bit)
- libc.so.6(GLIBC_2.27)(64bit)
- libperl.so.5.42()(64bit)
- perl(:MODULE_COMPAT_5.42.1)
- perl(:VERSION) >= 5.8.1
- perl(Exporter)
- perl(XSLoader)
- perl(strict)
- perl(warnings)
- perl-libs
- rpmlib(CompressedFileNames) <= 3.0.4-1
- rpmlib(FileDigests) <= 4.6.0-1
- rpmlib(PayloadFilesHavePrefix) <= 4.0-1
- rpmlib(PayloadIsZstd) <= 5.4.18-1
- rtld(GNU_HASH)
Provides3
- perl(Math::ConvexHull::MonotoneChain) = 0.01
- perl-Math-ConvexHull-MonotoneChain = 0.01-47.fc45
- perl-Math-ConvexHull-MonotoneChain(riscv-64) = 0.01-47.fc45
ObsoletesNo Obsoletes
ConflictsNo Conflicts
RecommendsNo Recommends
SuggestsNo Suggests
SupplementsNo Supplements
EnhancesNo Enhances
Files
13
Files 1–13 of 13
Component of
buildroots that installed this RPMNo Buildroots
