libmath-convexhull-monotonechain-perl 0.1-2 source package in Ubuntu
Changelog
libmath-convexhull-monotonechain-perl (0.1-2) unstable; urgency=medium [ gregor herrmann ] * Strip trailing slash from metacpan URLs. [ Salvatore Bonaccorso ] * Update Vcs-Browser URL to cgit web frontend * debian/control: Use HTTPS transport protocol for Vcs-Git URI [ gregor herrmann ] * debian/copyright: change Copyright-Format 1.0 URL to HTTPS. * Remove Nicolas Dandrimont from Uploaders. Thanks for your work! [ Salvatore Bonaccorso ] * Update Vcs-* headers for switch to salsa.debian.org [ gregor herrmann ] * debian/control: update Build-Depends for cross builds. * debian/watch: use uscan version 4. [ Debian Janitor ] * Bump debhelper from old 9 to 12. * Set debhelper-compat version in Build-Depends. -- Jelmer Vernooij <email address hidden> Wed, 15 Jun 2022 18:57:28 +0100
Upload details
- Uploaded by:
- Debian Perl Group
- Uploaded to:
- Sid
- Original maintainer:
- Debian Perl Group
- Architectures:
- any
- Section:
- misc
- Urgency:
- Medium Urgency
See full publishing history Publishing
Series | Published | Component | Section |
---|
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
libmath-convexhull-monotonechain-perl_0.1-2.dsc | 2.2 KiB | d12284219bc4de52c412309b7f49e9473390cbbc1d3d61b0ff385703bace9bb6 |
libmath-convexhull-monotonechain-perl_0.1.orig.tar.gz | 46.0 KiB | 288bc45908263245548f91482ab1248868dd9dee447f9ca26cad79613e3b94f5 |
libmath-convexhull-monotonechain-perl_0.1-2.debian.tar.xz | 2.0 KiB | 14e26870f4a7b9aece9b280f64a1771fcc35653748dde3e328692795a79dd53d |
Available diffs
No changes file available.
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