Bug#709907: ITP: libmath-convexhull-monotonechain-perl -- Perl module to calculate a convex hull using Andrew's monotone chain algorithm

[Nicolas Dandrimont <nicolas.dandrimont@crans.org>]

Package: wnpp
Severity: wishlist
Owner: Nicolas Dandrimont <nicolas.dandrimont@crans.org>

* Package name    : libmath-convexhull-monotonechain-perl
  Version         : 0.01
  Upstream Author : Steffen Mueller, <smueller@cpan.org>
* URL             : https://metacpan.org/release/Math-ConvexHull-MonotoneChain
* License         : GPL-1+ or Artistic (same as Perl)
  Programming Lang: Perl/C
  Description     : Perl module to calculate a convex hull using Andrew's monotone chain algorithm

This (XS) module 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.

This package is a dependency for Slic3r (ITP #689636) and will be maintained
under the umbrella of the Debian Perl Group.