libmath-convexhull-monotonechain-perl binary package in Ubuntu Lunar s390x
Math::
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.
Publishing history
Date | Status | Target | Component | Section | Priority | Phased updates | Version | ||
---|---|---|---|---|---|---|---|---|---|
2022-12-13 04:25:02 UTC | Published | Ubuntu Lunar s390x | release | universe | perl | Optional | 0.1-2build1 | ||
|
|||||||||
Deleted | Ubuntu Lunar s390x | proposed | universe | perl | Optional | 0.1-2build1 | |||
|
|||||||||
2022-12-13 04:32:07 UTC | Superseded | Ubuntu Lunar s390x | release | universe | perl | Optional | 0.1-2 | ||
|