perl-Math-ConvexHull-MonotoneChain
Andrew's monotone chain algorithm for finding a convex hull in 2D
This is somewhat experimental still. This (XS) module optionally exports a single function 'convex_hull' which calculates the convex hull of the input points and returns it. The algorithm is 'O(n log n)' due to having to sort the input list, but should be somewhat faster than a plain Graham's scan (also 'O(n log n)') in practice since it avoids polar coordinates.
Для openSUSE Leap 15.5 нет официального пакетаДистрибутивы
openSUSE Tumbleweed
openSUSE Leap 15.6
openSUSE Leap 15.5
openSUSE Leap 15.4
SUSE SLE-15-SP1
Неподдерживаемые дистрибутивы
Следующие дистрибутивы не имеют официальной поддержки. Используйте их пакеты на свой страх и риск.