| 1 |
Source: neartree |
| 2 |
Maintainer: Debian Science Maintainers <[email protected]> |
| 3 |
Uploaders: Teemu Ikonen <[email protected]> |
| 4 |
Section: libdevel |
| 5 |
Priority: optional |
| 6 |
Build-Depends: dpkg-dev (>= 1.22.5), debhelper-compat (= 13), |
| 7 |
libtool-bin, |
| 8 |
libcvector-dev |
| 9 |
Standards-Version: 4.6.2 |
| 10 |
Vcs-Browser: https://salsa.debian.org/science-team/neartree |
| 11 |
Vcs-Git: https://salsa.debian.org/science-team/neartree.git |
| 12 |
Homepage: https://neartree.sourceforge.net/ |
| 13 |
Rules-Requires-Root: no |
| 14 |
|
| 15 |
Package: libcneartree-dev |
| 16 |
Architecture: any |
| 17 |
Multi-Arch: same |
| 18 |
Depends: libcneartree7t64 (= ${binary:Version}), |
| 19 |
${misc:Depends} |
| 20 |
Pre-Depends: ${misc:Pre-Depends} |
| 21 |
Conflicts: libcneartree3-dev |
| 22 |
Description: Library and headers for solving the Nearest Neighbor Problem |
| 23 |
Neartree is an API and a library for finding nearest neighbors among |
| 24 |
points in spaces of arbitrary dimensions. This package provides a C++ |
| 25 |
template, TNear.h, and C library and header files for compiling |
| 26 |
programs using Neartree. |
| 27 |
. |
| 28 |
The library uses the Nearest Neighbor algorithm after Kalantari and |
| 29 |
McDonald, (IEEE Transactions on Software Engineering, v. SE-9, pp. |
| 30 |
631-634,1983) modified to use recursion instead of a double-linked tree |
| 31 |
and simplified so that it does less checking for things like is the |
| 32 |
distance to the right less than the distance to the left; it was found |
| 33 |
that these checks make little to no difference. |
| 34 |
|
| 35 |
Package: libcneartree7t64 |
| 36 |
Provides: ${t64:Provides} |
| 37 |
Replaces: libcneartree7 |
| 38 |
Breaks: libcneartree7 (<< ${source:Version}) |
| 39 |
Architecture: any |
| 40 |
Multi-Arch: same |
| 41 |
Section: libs |
| 42 |
Depends: ${shlibs:Depends}, |
| 43 |
${misc:Depends} |
| 44 |
Pre-Depends: ${misc:Pre-Depends} |
| 45 |
Description: Library for solving the Nearest Neighbor Problem |
| 46 |
Neartree is an API and a library for finding nearest neighbors among |
| 47 |
points in spaces of arbitrary dimensions. |
| 48 |
. |
| 49 |
The library uses the Nearest Neighbor algorithm after Kalantari and |
| 50 |
McDonald, (IEEE Transactions on Software Engineering, v. SE-9, pp. |
| 51 |
631-634,1983) modified to use recursion instead of a double-linked tree |
| 52 |
and simplified so that it does less checking for things like is the |
| 53 |
distance to the right less than the distance to the left; it was found |
| 54 |
that these checks make little to no difference. |