alla flaggor
buster  ] [  bullseye  ] [  bookworm  ] [  trixie  ] [  sid  ]
[ Källkod: libmath-convexhull-monotonechain-perl  ]

Paket: libmath-convexhull-monotonechain-perl (0.1-1 och andra)

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

Screenshot

Debianresurser:

Hämta källkodspaketet libmath-convexhull-monotonechain-perl:

Ansvariga:

Externa resurser:

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.

Märken: Software Development: Perl Development, Bibliotek, Implemented in: implemented-in::c, implemented-in::perl, Role: Development Library

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

  • beror
  • rekommenderar
  • föreslår
  • enhances

Hämta libmath-convexhull-monotonechain-perl

Hämtningar för alla tillgängliga arkitekturer
Arkitektur Version Paketstorlek Installerad storlek Filer
arm64 0.1-1+b6 8,4 kbyte38,0 kbyte [filförteckning]