Paket: libcneartree-dev (5.1.1+dfsg1-2)
Länkar för libcneartree-dev
Debianresurser:
Hämta källkodspaketet neartree:
- [neartree_5.1.1+dfsg1-2.dsc]
- [neartree_5.1.1+dfsg1.orig.tar.gz]
- [neartree_5.1.1+dfsg1-2.debian.tar.xz]
Ansvariga:
Externa resurser:
- Hemsida [neartree.sourceforge.net]
Liknande paket:
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.
Andra paket besläktade med libcneartree-dev
|
|
|
|
-
- dep: libcneartree7 (= 5.1.1+dfsg1-2)
- Library for solving the Nearest Neighbor Problem
Hämta libcneartree-dev
Arkitektur | Paketstorlek | Installerad storlek | Filer |
---|---|---|---|
amd64 | 79,8 kbyte | 692,0 kbyte | [filförteckning] |
arm64 | 75,7 kbyte | 682,0 kbyte | [filförteckning] |
armel | 75,4 kbyte | 682,0 kbyte | [filförteckning] |
armhf | 71,9 kbyte | 648,0 kbyte | [filförteckning] |
i386 | 80,5 kbyte | 683,0 kbyte | [filförteckning] |
mips64el | 78,2 kbyte | 708,0 kbyte | [filförteckning] |
mipsel | 79,3 kbyte | 684,0 kbyte | [filförteckning] |
ppc64el | 82,2 kbyte | 709,0 kbyte | [filförteckning] |
s390x | 75,3 kbyte | 687,0 kbyte | [filförteckning] |