libmath-convexhull-monotonechain-perl binary package in Ubuntu Noble amd64
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 | ||
---|---|---|---|---|---|---|---|---|---|
2024-04-03 13:11:29 UTC | Published | Ubuntu Noble amd64 | release | universe | perl | Optional | 0.1-2build4 | ||
|
|||||||||
Deleted | Ubuntu Noble amd64 | proposed | universe | perl | Optional | 0.1-2build4 | |||
|
|||||||||
2024-04-06 12:10:12 UTC | Deleted | Ubuntu Noble amd64 | updates | universe | perl | Optional | 0.1-2build2 | ||
|
|||||||||
2024-03-30 06:10:16 UTC | Deleted | Ubuntu Noble amd64 | release | universe | perl | Optional | 0.1-2build3 | ||
|
|||||||||
2024-03-30 06:10:16 UTC | Deleted | Ubuntu Noble amd64 | proposed | universe | perl | Optional | 0.1-2build3 | ||
|
|||||||||
2024-03-29 03:56:46 UTC | Superseded | Ubuntu Noble amd64 | release | universe | perl | Optional | 0.1-2build2 | ||
|
|||||||||
2024-04-06 12:10:12 UTC | Deleted | Ubuntu Noble amd64 | proposed | universe | perl | Optional | 0.1-2build2 | ||
|
|||||||||
2024-02-15 04:35:19 UTC | Superseded | Ubuntu Noble amd64 | release | universe | perl | Optional | 0.1-2build1 | ||
|