Paket: libmath-convexhull-monotonechain-perl (0.1-2 och andra) [debports]

Länkar för libmath-convexhull-monotonechain-perl

Debianresurser:

Felrapporter

Hämta källkodspaketet :

Hittades ej

Ansvariga:

Externa resurser:

Hemsida [metacpan.org]

Liknande paket:

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.

Andra paket besläktade med libmath-convexhull-monotonechain-perl

beror

rekommenderar

föreslår

enhances

dep: libc6 (>= 2.16)

GNU C-bibliotek: Delade bibliotek
också ett virtuellt paket som tillhandahålls av libc6-udeb
dep: perl (>= 5.38.2-3.2)

Larry Wall's Practical Extraction and Report Language
dep: perlapi-5.38.2t64

virtuellt paket som tillhandahålls av perl-base

Hämta libmath-convexhull-monotonechain-perl

Hämtningar för alla tillgängliga arkitekturer
Arkitektur	Version	Paketstorlek	Installerad storlek	Filer
x32 (inofficiell anpassning)	0.1-2+b3	9,0 kbyte	41,0 kbyte	[filförteckning]