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