File perl-Math-ConvexHull-MonotoneChain.spec of Package perl-Math-ConvexHull-MonotoneChain

# spec file for package perl-Math-ConvexHull-MonotoneChain
# Copyright (c) 2014 SUSE LINUX Products GmbH, Nuernberg, Germany.
# All modifications and additions to the file contributed by third parties
# remain the property of their copyright owners, unless otherwise agreed
# upon. The license for this file, and modifications and additions to the
# file, is the same license as for the pristine package itself (unless the
# license for the pristine package is not an Open Source License, in which
# case the license is the MIT License). An "Open Source License" is a
# license that conforms to the Open Source Definition (Version 1.9)
# published by the Open Source Initiative.

# Please submit bugfixes or comments via

Name:           perl-Math-ConvexHull-MonotoneChain
Version:        0.01
Release:        0
%define cpan_name Math-ConvexHull-MonotoneChain
Summary:        Andrew's monotone chain algorithm for finding a convex hull in 2D
License:        GPL-1.0+ or Artistic-1.0
Group:          Development/Libraries/Perl
BuildRoot:      %{_tmppath}/%{name}-%{version}-build
BuildRequires:  perl
BuildRequires:  perl-macros
BuildRequires:  perl(Test::More) >= 0.88
Requires:       perl(Test::More) >= 0.88

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.

%setup -q -n %{cpan_name}-%{version}

%{__perl} Makefile.PL INSTALLDIRS=vendor OPTIMIZE="%{optflags}"
%{__make} %{?_smp_mflags}

%{__make} test


%files -f %{name}.files
%doc Changes

openSUSE Build Service is sponsored by