Ubuntu
libmath-convexhull-monotonechain-perl package

libmath-convexhull-monotonechain-perl 0.1-2build4 source package in Ubuntu

Changelog

libmath-convexhull-monotonechain-perl (0.1-2build4) noble; urgency=medium

  * No-change rebuild for CVE-2024-3094

 -- Steve Langasek <email address hidden>  Sun, 31 Mar 2024 19:13:31 +0000

Upload details

Uploaded by:
Steve Langasek
Uploaded to:
Noble
Original maintainer:
Ubuntu Developers
Architectures:
any
Section:
misc
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Oracular release universe misc
Noble release universe misc

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-2build4.debian.tar.xz 2.3 KiB 8ef9b910207fd10e5b21dbc072e08f4f21e76e6cca57566fb517d99d3643b77f
libmath-convexhull-monotonechain-perl_0.1-2build4.dsc 2.4 KiB e23e4408d1833e800d39f8f7f99eecb47e203640be24a48be2262db7db4995a2

Available diffs

View changes file

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