Tarkennettu haku
buster  ] [  bullseye  ] [  bookworm  ] [  trixie  ] [  sid  ]
[ Source:  ]

Paketti: libmath-convexhull-monotonechain-perl (0.1-2 ja muut) [debports]

Links for libmath-convexhull-monotonechain-perl

Screenshot

Debian-palvelut:

Imuroi lähdekoodipaketti :

Ei löytynyt

Ylläpitäjät:

External Resources:

Samankaltaisia paketteja:

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.

Muut pakettiin libmath-convexhull-monotonechain-perl liittyvät paketit

  • depends
  • recommends
  • suggests
  • enhances

Imuroi libmath-convexhull-monotonechain-perl

Imurointi kaikille saataville arkkitehtuureille
Arkkitehtuuri Versio Paketin koko Koko asennettuna Tiedostot
x32 (epävirallinen siirros) 0.1-2+b3 9.0 kt41.0 kt [tiedostoluettelo]