Ubuntu
libmath-convexhull-monotonechain-perl package

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

Changelog

libmath-convexhull-monotonechain-perl (0.1-1build3) xenial; urgency=medium

  * Rebuild for Perl 5.22.1.

 -- Colin Watson <email address hidden>  Thu, 17 Dec 2015 15:47:55 +0000

Upload details

Uploaded by:
Colin Watson
Uploaded to:
Xenial
Original maintainer:
Debian Perl Group
Architectures:
any
Section:
misc
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Xenial 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-1build3.debian.tar.xz 1.9 KiB 68574fe2687352fbff72742356a1d540ea417164d68f6fe2c914d4346fdba2ff
libmath-convexhull-monotonechain-perl_0.1-1build3.dsc 2.3 KiB cd797728843ad9a0eaefa4685e16ae8c963ca724e11ed5c9a139228ef0401921

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: No summary available for libmath-convexhull-monotonechain-perl-dbgsym in ubuntu zesty.

No description available for libmath-convexhull-monotonechain-perl-dbgsym in ubuntu zesty.