libmath-convexhull-monotonechain-perl 0.1-1build2 source package in Ubuntu
Changelog
libmath-convexhull-monotonechain-perl (0.1-1build2) utopic; urgency=medium * Rebuild for Perl 5.20.0. -- Colin Watson <email address hidden> Wed, 20 Aug 2014 12:30:45 +0100
Upload details
- Uploaded by:
- Colin Watson
- Uploaded to:
- Utopic
- Original maintainer:
- Debian Perl Group
- Architectures:
- any
- Section:
- perl
- Urgency:
- Medium Urgency
See full publishing history Publishing
Series | Published | Component | Section |
---|
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-1build2.debian.tar.gz | 1.9 KiB | 43709ba0888f138de1b6ba0bb1321281624c9809fcd3ae41a08efeccc485ad9f |
libmath-convexhull-monotonechain-perl_0.1-1build2.dsc | 2.3 KiB | 95c1ed2cddef79f0b93e5f4f683b8586de67d16044637cc9bd7a331aecbb9756 |
Available diffs
- diff from 0.1-1build1 (in Ubuntu) to 0.1-1build2 (348 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.
- libmath-convexhull-monotonechain-perl-dbgsym: debug symbols for package libmath-convexhull-monotonechain-perl
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.