libmath-convexhull-monotonechain-perl 0.1-1build7 (i386 binary) in ubuntu focal
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.
Details
- Package version:
- 0.1-1build7
- Status:
- Deleted
- Component:
- universe
- Priority:
- Optional
Downloadable files
Package relationships
- Depends on:
- libc6 (>= 2.1.3)
- perl (>= 5.30.0-7)
- perlapi-5.30.0