Ubuntu
libmath-convexhull-monotonechain-perl package

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

Changelog

libmath-convexhull-monotonechain-perl (0.1-2build1) lunar; urgency=medium

  * Rebuild against new perlapi-5.36.

 -- Gianfranco Costamagna <email address hidden>  Fri, 04 Nov 2022 11:57:58 +0100

Upload details

Uploaded by:
Gianfranco Costamagna
Uploaded to:
Lunar
Original maintainer:
Debian Perl Group
Architectures:
any
Section:
misc
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Mantic release universe misc
Lunar 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-2build1.debian.tar.xz 2.1 KiB b743ac3ba035c68945611c2674a5c3fbba27357ae75e9cc1342acedf656575ca
libmath-convexhull-monotonechain-perl_0.1-2build1.dsc 2.2 KiB 048a42a747928eb4fab7573907ac930e4363a735ba93b81d7e7ecc321ca90b2a

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