libmath-convexhull-monotonechain-perl 0.1-1build1 source package in Ubuntu
Changelog
libmath-convexhull-monotonechain-perl (0.1-1build1) trusty; urgency=low * Rebuild for Perl 5.18. -- Colin Watson <email address hidden> Mon, 21 Oct 2013 10:20:29 +0100
Upload details
- Uploaded by:
- Colin Watson
- Uploaded to:
- Trusty
- Original maintainer:
- Debian Perl Group
- Architectures:
- any
- Section:
- misc
- Urgency:
- Low Urgency
See full publishing history Publishing
Series | Published | Component | Section | |
---|---|---|---|---|
Trusty | 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-1build1.debian.tar.gz | 1.8 KiB | c8d7607fe60a28e000bf2051aacf6e0aef8463a3854c381cfb07c72e89633e3c |
libmath-convexhull-monotonechain-perl_0.1-1build1.dsc | 2.3 KiB | 866347f54371443bc767370a4bd4495e967a3676ea57f4ee632fcff5e57ba8d1 |
Available diffs
- diff from 0.1-1 (in Debian) to 0.1-1build1 (375 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.