Ubuntu
libmath-convexhull-monotonechain-perl package

libmath-convexhull-monotonechain-perl 0.1-1build7 source package in Ubuntu

Changelog

libmath-convexhull-monotonechain-perl (0.1-1build7) focal; urgency=medium

  * No-change rebuild for the perl update.

 -- Matthias Klose <email address hidden>  Fri, 18 Oct 2019 19:32:53 +0000

Upload details

Uploaded by:
Matthias Klose
Uploaded to:
Focal
Original maintainer:
Debian Perl Group
Architectures:
any
Section:
misc
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Focal 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-1build7.debian.tar.xz 2.1 KiB c1f9e74f4e5a4116510dcda17b81b3c1808b3b59dc420f6698edcf4edfe2707d
libmath-convexhull-monotonechain-perl_0.1-1build7.dsc 2.3 KiB d7294f293671e76f09a7329891412672d22dce336c705bfcbfac99ed998a7676

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