libmath-convexhull-monotonechain-perl 0.1-2build3 source package in Ubuntu
Changelog
libmath-convexhull-monotonechain-perl (0.1-2build3) noble; urgency=medium * No-change rebuild for perlapi5.38t64. -- Matthias Klose <email address hidden> Sat, 02 Mar 2024 15:52:00 +0100
Upload details
- Uploaded by:
- Matthias Klose
- Uploaded to:
- Noble
- Original maintainer:
- Debian Perl Group
- Architectures:
- any
- Section:
- misc
- Urgency:
- Medium Urgency
See full publishing history Publishing
Series | Published | Component | Section |
---|
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
libmath-convexhull-monotonechain-perl_0.1.orig.tar.gz | 46.0 KiB | 288bc45908263245548f91482ab1248868dd9dee447f9ca26cad79613e3b94f5 |
libmath-convexhull-monotonechain-perl_0.1-2build3.debian.tar.xz | 2.2 KiB | c42ff46b9a09c7d5efa332fdb0497b9f830c55b1a7b1d593d72c0f02d2e7f2d5 |
libmath-convexhull-monotonechain-perl_0.1-2build3.dsc | 2.2 KiB | e8360ce065691924bbb43503e30da96a390310b1a53ffcadc314aab2f6305b33 |
Available diffs
- diff from 0.1-2build2 to 0.1-2build3 (350 bytes)
Binary packages built by this source
- libmath-convexhull-monotonechain-perl: Perl module to calculate a convex hull using Andrew's monotone chain algorithm
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.
- libmath-convexhull-monotonechain-perl-dbgsym: debug symbols for libmath-convexhull-monotonechain-perl