SUSE Package Hub 15 one-click install
Install perl-Math-ConvexHull
NOTE: This one-click installation requires that the SUSE Package Hub extension to already be enabled.
See http://packagehub.suse.com/how-to-use/ for information on enabling the Package Hub extension
If the extension is not enabled, this installation will fail while trying to enable an invalid repo.
This package might depend on packages from SUSE Linux Enterprise modules. If those modules are not enabled, a package dependency error will be encountered.
SUSE-PackageHub-15-Standard-Pool
Package Hub 15
Dummy repo - this will fail
-
perl-Math-ConvexHull
Calculate convex hulls using Graham's scan (n*log(n))
'Math::ConvexHull' is a simple module that calculates convex hulls from a
set of points in 2D space. It is a straightforward implementation of the
algorithm known as Graham's scan which, with complexity of O(n*log(n)), is
the fastest known method of finding the convex hull of an arbitrary set of
points. There are some methods of eliminating points that cannot be part of
the convex hull. These may or may not be implemented in a future version.
The implementation cannot deal with duplicate points. Therefore, points
which are very, very close (think floating point close) to the previous
point are dropped since version 1.02 of the module. However, if you pass in
randomly ordered data which contains duplicate points, this safety measure
might not help you. In that case, you will have to remove duplicates
yourself.
SUSE Package Hub 15 one-click install
Install perl-Math-ConvexHull
NOTE: This one-click installation requires that the SUSE Package Hub extension to already be enabled.
See http://packagehub.suse.com/how-to-use/ for information on enabling the Package Hub extension
If the extension is not enabled, this installation will fail while trying to enable an invalid repo.
This package might depend on packages from SUSE Linux Enterprise modules. If those modules are not enabled, a package dependency error will be encountered.
SUSE-PackageHub-15-Standard-Pool
Package Hub 15
Dummy repo - this will fail
-
perl-Math-ConvexHull
Calculate convex hulls using Graham's scan (n*log(n))
'Math::ConvexHull' is a simple module that calculates convex hulls from a
set of points in 2D space. It is a straightforward implementation of the
algorithm known as Graham's scan which, with complexity of O(n*log(n)), is
the fastest known method of finding the convex hull of an arbitrary set of
points. There are some methods of eliminating points that cannot be part of
the convex hull. These may or may not be implemented in a future version.
The implementation cannot deal with duplicate points. Therefore, points
which are very, very close (think floating point close) to the previous
point are dropped since version 1.02 of the module. However, if you pass in
randomly ordered data which contains duplicate points, this safety measure
might not help you. In that case, you will have to remove duplicates
yourself.
SUSE Package Hub 15 SP1 one-click install
Install perl-Math-ConvexHull
NOTE: This one-click installation requires that the SUSE Package Hub extension to already be enabled.
See http://packagehub.suse.com/how-to-use/ for information on enabling the Package Hub extension
If the extension is not enabled, this installation will fail while trying to enable an invalid repo.
This package might depend on packages from SUSE Linux Enterprise modules. If those modules are not enabled, a package dependency error will be encountered.
SUSE-PackageHub-15-SP1-Backports-Pool
Package Hub 15 SP1
Dummy repo - this will fail
-
perl-Math-ConvexHull
Calculate convex hulls using Graham's scan (n*log(n))
'Math::ConvexHull' is a simple module that calculates convex hulls from a
set of points in 2D space. It is a straightforward implementation of the
algorithm known as Graham's scan which, with complexity of O(n*log(n)), is
the fastest known method of finding the convex hull of an arbitrary set of
points. There are some methods of eliminating points that cannot be part of
the convex hull. These may or may not be implemented in a future version.
The implementation cannot deal with duplicate points. Therefore, points
which are very, very close (think floating point close) to the previous
point are dropped since version 1.02 of the module. However, if you pass in
randomly ordered data which contains duplicate points, this safety measure
might not help you. In that case, you will have to remove duplicates
yourself.
SUSE Package Hub 15 SP1 one-click install
Install perl-Math-ConvexHull
NOTE: This one-click installation requires that the SUSE Package Hub extension to already be enabled.
See http://packagehub.suse.com/how-to-use/ for information on enabling the Package Hub extension
If the extension is not enabled, this installation will fail while trying to enable an invalid repo.
This package might depend on packages from SUSE Linux Enterprise modules. If those modules are not enabled, a package dependency error will be encountered.
SUSE-PackageHub-15-SP1-Backports-Pool
Package Hub 15 SP1
Dummy repo - this will fail
-
perl-Math-ConvexHull
Calculate convex hulls using Graham's scan (n*log(n))
'Math::ConvexHull' is a simple module that calculates convex hulls from a
set of points in 2D space. It is a straightforward implementation of the
algorithm known as Graham's scan which, with complexity of O(n*log(n)), is
the fastest known method of finding the convex hull of an arbitrary set of
points. There are some methods of eliminating points that cannot be part of
the convex hull. These may or may not be implemented in a future version.
The implementation cannot deal with duplicate points. Therefore, points
which are very, very close (think floating point close) to the previous
point are dropped since version 1.02 of the module. However, if you pass in
randomly ordered data which contains duplicate points, this safety measure
might not help you. In that case, you will have to remove duplicates
yourself.
SUSE Package Hub 15 SP2 one-click install
Install perl-Math-ConvexHull
NOTE: This one-click installation requires that the SUSE Package Hub extension to already be enabled.
See http://packagehub.suse.com/how-to-use/ for information on enabling the Package Hub extension
If the extension is not enabled, this installation will fail while trying to enable an invalid repo.
This package might depend on packages from SUSE Linux Enterprise modules. If those modules are not enabled, a package dependency error will be encountered.
SUSE-PackageHub-15-SP2-Backports-Pool
Package Hub 15 SP2
Dummy repo - this will fail
-
perl-Math-ConvexHull
Calculate convex hulls using Graham's scan (n*log(n))
'Math::ConvexHull' is a simple module that calculates convex hulls from a
set of points in 2D space. It is a straightforward implementation of the
algorithm known as Graham's scan which, with complexity of O(n*log(n)), is
the fastest known method of finding the convex hull of an arbitrary set of
points. There are some methods of eliminating points that cannot be part of
the convex hull. These may or may not be implemented in a future version.
The implementation cannot deal with duplicate points. Therefore, points
which are very, very close (think floating point close) to the previous
point are dropped since version 1.02 of the module. However, if you pass in
randomly ordered data which contains duplicate points, this safety measure
might not help you. In that case, you will have to remove duplicates
yourself.
SUSE Package Hub 15 SP2 one-click install
Install perl-Math-ConvexHull
NOTE: This one-click installation requires that the SUSE Package Hub extension to already be enabled.
See http://packagehub.suse.com/how-to-use/ for information on enabling the Package Hub extension
If the extension is not enabled, this installation will fail while trying to enable an invalid repo.
This package might depend on packages from SUSE Linux Enterprise modules. If those modules are not enabled, a package dependency error will be encountered.
SUSE-PackageHub-15-SP2-Backports-Pool
Package Hub 15 SP2
Dummy repo - this will fail
-
perl-Math-ConvexHull
Calculate convex hulls using Graham's scan (n*log(n))
'Math::ConvexHull' is a simple module that calculates convex hulls from a
set of points in 2D space. It is a straightforward implementation of the
algorithm known as Graham's scan which, with complexity of O(n*log(n)), is
the fastest known method of finding the convex hull of an arbitrary set of
points. There are some methods of eliminating points that cannot be part of
the convex hull. These may or may not be implemented in a future version.
The implementation cannot deal with duplicate points. Therefore, points
which are very, very close (think floating point close) to the previous
point are dropped since version 1.02 of the module. However, if you pass in
randomly ordered data which contains duplicate points, this safety measure
might not help you. In that case, you will have to remove duplicates
yourself.
SUSE Package Hub 15 SP3 one-click install
Install perl-Math-ConvexHull
NOTE: This one-click installation requires that the SUSE Package Hub extension to already be enabled.
See http://packagehub.suse.com/how-to-use/ for information on enabling the Package Hub extension
If the extension is not enabled, this installation will fail while trying to enable an invalid repo.
This package might depend on packages from SUSE Linux Enterprise modules. If those modules are not enabled, a package dependency error will be encountered.
SUSE-PackageHub-15-SP3-Backports-Pool
Package Hub 15 SP3
Dummy repo - this will fail
-
perl-Math-ConvexHull
Calculate convex hulls using Graham's scan (n*log(n))
'Math::ConvexHull' is a simple module that calculates convex hulls from a
set of points in 2D space. It is a straightforward implementation of the
algorithm known as Graham's scan which, with complexity of O(n*log(n)), is
the fastest known method of finding the convex hull of an arbitrary set of
points. There are some methods of eliminating points that cannot be part of
the convex hull. These may or may not be implemented in a future version.
The implementation cannot deal with duplicate points. Therefore, points
which are very, very close (think floating point close) to the previous
point are dropped since version 1.02 of the module. However, if you pass in
randomly ordered data which contains duplicate points, this safety measure
might not help you. In that case, you will have to remove duplicates
yourself.
SUSE Package Hub 15 SP3 one-click install
Install perl-Math-ConvexHull
NOTE: This one-click installation requires that the SUSE Package Hub extension to already be enabled.
See http://packagehub.suse.com/how-to-use/ for information on enabling the Package Hub extension
If the extension is not enabled, this installation will fail while trying to enable an invalid repo.
This package might depend on packages from SUSE Linux Enterprise modules. If those modules are not enabled, a package dependency error will be encountered.
SUSE-PackageHub-15-SP3-Backports-Pool
Package Hub 15 SP3
Dummy repo - this will fail
-
perl-Math-ConvexHull
Calculate convex hulls using Graham's scan (n*log(n))
'Math::ConvexHull' is a simple module that calculates convex hulls from a
set of points in 2D space. It is a straightforward implementation of the
algorithm known as Graham's scan which, with complexity of O(n*log(n)), is
the fastest known method of finding the convex hull of an arbitrary set of
points. There are some methods of eliminating points that cannot be part of
the convex hull. These may or may not be implemented in a future version.
The implementation cannot deal with duplicate points. Therefore, points
which are very, very close (think floating point close) to the previous
point are dropped since version 1.02 of the module. However, if you pass in
randomly ordered data which contains duplicate points, this safety measure
might not help you. In that case, you will have to remove duplicates
yourself.
SUSE Package Hub 15 SP4 one-click install
Install perl-Math-ConvexHull
NOTE: This one-click installation requires that the SUSE Package Hub extension to already be enabled.
See http://packagehub.suse.com/how-to-use/ for information on enabling the Package Hub extension
If the extension is not enabled, this installation will fail while trying to enable an invalid repo.
This package might depend on packages from SUSE Linux Enterprise modules. If those modules are not enabled, a package dependency error will be encountered.
SUSE-PackageHub-15-SP4-Backports-Pool
Package Hub 15 SP4
Dummy repo - this will fail
-
perl-Math-ConvexHull
Calculate convex hulls using Graham's scan (n*log(n))
'Math::ConvexHull' is a simple module that calculates convex hulls from a
set of points in 2D space. It is a straightforward implementation of the
algorithm known as Graham's scan which, with complexity of O(n*log(n)), is
the fastest known method of finding the convex hull of an arbitrary set of
points. There are some methods of eliminating points that cannot be part of
the convex hull. These may or may not be implemented in a future version.
The implementation cannot deal with duplicate points. Therefore, points
which are very, very close (think floating point close) to the previous
point are dropped since version 1.02 of the module. However, if you pass in
randomly ordered data which contains duplicate points, this safety measure
might not help you. In that case, you will have to remove duplicates
yourself.
SUSE Package Hub 15 SP4 one-click install
Install perl-Math-ConvexHull
NOTE: This one-click installation requires that the SUSE Package Hub extension to already be enabled.
See http://packagehub.suse.com/how-to-use/ for information on enabling the Package Hub extension
If the extension is not enabled, this installation will fail while trying to enable an invalid repo.
This package might depend on packages from SUSE Linux Enterprise modules. If those modules are not enabled, a package dependency error will be encountered.
SUSE-PackageHub-15-SP4-Backports-Pool
Package Hub 15 SP4
Dummy repo - this will fail
-
perl-Math-ConvexHull
Calculate convex hulls using Graham's scan (n*log(n))
'Math::ConvexHull' is a simple module that calculates convex hulls from a
set of points in 2D space. It is a straightforward implementation of the
algorithm known as Graham's scan which, with complexity of O(n*log(n)), is
the fastest known method of finding the convex hull of an arbitrary set of
points. There are some methods of eliminating points that cannot be part of
the convex hull. These may or may not be implemented in a future version.
The implementation cannot deal with duplicate points. Therefore, points
which are very, very close (think floating point close) to the previous
point are dropped since version 1.02 of the module. However, if you pass in
randomly ordered data which contains duplicate points, this safety measure
might not help you. In that case, you will have to remove duplicates
yourself.
SUSE Package Hub 15 SP5 one-click install
Install perl-Math-ConvexHull
NOTE: This one-click installation requires that the SUSE Package Hub extension to already be enabled.
See http://packagehub.suse.com/how-to-use/ for information on enabling the Package Hub extension
If the extension is not enabled, this installation will fail while trying to enable an invalid repo.
This package might depend on packages from SUSE Linux Enterprise modules. If those modules are not enabled, a package dependency error will be encountered.
SUSE-PackageHub-15-SP5-Standard-Pool
Package Hub 15 SP5
Dummy repo - this will fail
-
perl-Math-ConvexHull
Calculate convex hulls using Graham's scan (n*log(n))
'Math::ConvexHull' is a simple module that calculates convex hulls from a
set of points in 2D space. It is a straightforward implementation of the
algorithm known as Graham's scan which, with complexity of O(n*log(n)), is
the fastest known method of finding the convex hull of an arbitrary set of
points. There are some methods of eliminating points that cannot be part of
the convex hull. These may or may not be implemented in a future version.
The implementation cannot deal with duplicate points. Therefore, points
which are very, very close (think floating point close) to the previous
point are dropped since version 1.02 of the module. However, if you pass in
randomly ordered data which contains duplicate points, this safety measure
might not help you. In that case, you will have to remove duplicates
yourself.
SUSE Package Hub 15 SP5 one-click install
Install perl-Math-ConvexHull
NOTE: This one-click installation requires that the SUSE Package Hub extension to already be enabled.
See http://packagehub.suse.com/how-to-use/ for information on enabling the Package Hub extension
If the extension is not enabled, this installation will fail while trying to enable an invalid repo.
This package might depend on packages from SUSE Linux Enterprise modules. If those modules are not enabled, a package dependency error will be encountered.
SUSE-PackageHub-15-SP5-Standard-Pool
Package Hub 15 SP5
Dummy repo - this will fail
-
perl-Math-ConvexHull
Calculate convex hulls using Graham's scan (n*log(n))
'Math::ConvexHull' is a simple module that calculates convex hulls from a
set of points in 2D space. It is a straightforward implementation of the
algorithm known as Graham's scan which, with complexity of O(n*log(n)), is
the fastest known method of finding the convex hull of an arbitrary set of
points. There are some methods of eliminating points that cannot be part of
the convex hull. These may or may not be implemented in a future version.
The implementation cannot deal with duplicate points. Therefore, points
which are very, very close (think floating point close) to the previous
point are dropped since version 1.02 of the module. However, if you pass in
randomly ordered data which contains duplicate points, this safety measure
might not help you. In that case, you will have to remove duplicates
yourself.