Sign Up
Log In
Log In
or
Sign Up
Places
All Projects
Status Monitor
Collapse sidebar
home:aeszter
ann
ann.spec
Overview
Repositories
Revisions
Requests
Users
Attributes
Meta
File ann.spec of Package ann
Name: ann Version: 1.1.2 Release: 1 License: LGPL Summary: Approximate nearest neighbour search Url: http://www.cs.umd.edu/~mount/ANN Group: Productivity/Scientific/Physics Source: %{name}_%{version}.tar.bz2 Patch1: 1-cflags.patch #Patch2: 2-shared.patch Patch3: 3-pic.patch BuildRequires: gcc-c++ BuildRoot: %{_tmppath}/%{name}-%{version}-build %description ANN is a library written in C++, which supports data structures and algorithms for both exact and approximate nearest neighbor searching in arbitrarily high dimensions. In the nearest neighbor problem a set of data points in d-dimensional space is given. These points are preprocessed into a data structure, so that given any query point q, the nearest or generally k nearest points of P to q can be reported efficiently. The distance between two points can be defined in many ways. ANN assumes that distances are measured using any class of distance functions called Minkowski metrics. These include the well known Euclidean distance, Manhattan distance, and max distance. Based on our own experience, ANN performs quite efficiently for point sets ranging in size from thousands to hundreds of thousands, and in dimensions as high as 20. (For applications in significantly higher dimensions, the results are rather spotty, but you might try it anyway.) The library implements a number of different data structures, based on kd-trees and box-decomposition trees, and employs a couple of different search strategies. The library also comes with test programs for measuring the quality of performance of ANN on any particular data sets, as well as programs for visualizing the structure of the geometric data structures. Authors: --------- David M. Mount Sunil Arya %package devel Summary: Approximate nearest neighbour search Group: Development/Libraries/C and C++ %description devel ANN is a library written in C++, which supports data structures and algorithms for both exact and approximate nearest neighbor searching in arbitrarily high dimensions. In the nearest neighbor problem a set of data points in d-dimensional space is given. These points are preprocessed into a data structure, so that given any query point q, the nearest or generally k nearest points of P to q can be reported efficiently. The distance between two points can be defined in many ways. ANN assumes that distances are measured using any class of distance functions called Minkowski metrics. These include the well known Euclidean distance, Manhattan distance, and max distance. Based on our own experience, ANN performs quite efficiently for point sets ranging in size from thousands to hundreds of thousands, and in dimensions as high as 20. (For applications in significantly higher dimensions, the results are rather spotty, but you might try it anyway.) The library implements a number of different data structures, based on kd-trees and box-decomposition trees, and employs a couple of different search strategies. The library also comes with test programs for measuring the quality of performance of ANN on any particular data sets, as well as programs for visualizing the structure of the geometric data structures. This package contains header files and the static library. Authors: --------- David M. Mount Sunil Arya %package doc Summary: Approximate nearest neighbour search Group: Productivity/Scientific/Physics %description doc ANN is a library written in C++, which supports data structures and algorithms for both exact and approximate nearest neighbor searching in arbitrarily high dimensions. In the nearest neighbor problem a set of data points in d-dimensional space is given. These points are preprocessed into a data structure, so that given any query point q, the nearest or generally k nearest points of P to q can be reported efficiently. The distance between two points can be defined in many ways. ANN assumes that distances are measured using any class of distance functions called Minkowski metrics. These include the well known Euclidean distance, Manhattan distance, and max distance. Based on our own experience, ANN performs quite efficiently for point sets ranging in size from thousands to hundreds of thousands, and in dimensions as high as 20. (For applications in significantly higher dimensions, the results are rather spotty, but you might try it anyway.) The library implements a number of different data structures, based on kd-trees and box-decomposition trees, and employs a couple of different search strategies. The library also comes with test programs for measuring the quality of performance of ANN on any particular data sets, as well as programs for visualizing the structure of the geometric data structures. This package contains the documentation. Authors: --------- David M. Mount Sunil Arya %prep %setup -n %{name}_%{version} %patch1 %patch3 %build make %{?_smp_mflags} CFLAGS="$RPM_OPT_FLAGS" linux-g++ rm -f sample/*.o %install mkdir -p $RPM_BUILD_ROOT/%{_includedir}/ANN install include/ANN/* $RPM_BUILD_ROOT/%{_includedir}/ANN mkdir -p $RPM_BUILD_ROOT/%{_libdir} install lib/* $RPM_BUILD_ROOT/%{_libdir} mkdir -p $RPM_BUILD_ROOT/%{_bindir} install bin/* $RPM_BUILD_ROOT/%{_bindir} %clean %{?buildroot:%__rm -rf "%{buildroot}"} %files %defattr(0755,root,root) %{_bindir}/ann2fig %{_bindir}/ann_sample %{_bindir}/ann_test %files devel %defattr(-,root,root) %dir %{_includedir}/ANN %attr (0644,root,root) %{_includedir}/ANN/* %attr (0644,root,root) %{_libdir}/lib* %files doc %defattr(-,root,root) %doc Copyright.txt License.txt ReadMe.txt doc/* sample %changelog
Locations
Projects
Search
Status Monitor
Help
OpenBuildService.org
Documentation
API Documentation
Code of Conduct
Contact
Support
@OBShq
Terms
openSUSE Build Service is sponsored by
The Open Build Service is an
openSUSE project
.
Sign Up
Log In
Places
Places
All Projects
Status Monitor
