Monotone chain algorithm for finding a convex hull in 2D
64.02 KB
built 2026-10-16 21:43:29 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
17 totalRequires16
- coreutils
- findutils
- gcc-c++
- make
- perl(Data::Dumper)
- perl(Exporter)
- perl(ExtUtils::MakeMaker) >= 6.76
- perl(Test::More) >= 0.88
- perl(XSLoader)
- perl(strict)
- perl(warnings)
- perl-devel
- perl-generators
- perl-interpreter
- rpmlib(CompressedFileNames) <= 3.0.4-1
- rpmlib(FileDigests) <= 4.6.0-1
Provides1
- perl-Math-ConvexHull-MonotoneChain = 0.01-47.fc45
ObsoletesNo Obsoletes
ConflictsNo Conflicts
RecommendsNo Recommends
SuggestsNo Suggests
SupplementsNo Supplements
EnhancesNo Enhances
Files
2Name  |
Size |
|---|---|
| Math-ConvexHull-MonotoneChain-0.01.tar.gz | 46.00 KB |
| perl-Math-ConvexHull-MonotoneChain.spec | 7.70 KB |
Files 1–2 of 2
Component of
buildroots that installed this RPMNo Buildroots