[ nabia ]
[ aramo ]
[ Källkod: neartree ]
Paket: libcneartree7 (5.1.1+dfsg1-1)
Länkar för libcneartree7
Trisquelresurser:
Hämta källkodspaketet neartree:
- [neartree_5.1.1+dfsg1-1.dsc]
- [neartree_5.1.1+dfsg1.orig.tar.gz]
- [neartree_5.1.1+dfsg1-1.debian.tar.xz]
Ansvarig:
Original Maintainers:
- Debian Science Maintainers (E-postarkiv)
- Teemu Ikonen
Externa resurser:
- Hemsida [neartree.sourceforge.net]
Liknande paket:
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.
Andra paket besläktade med libcneartree7
|
|
|
-
- dep: libc6 (>= 2.4)
- GNU C Library: Shared libraries
också ett virtuellt paket som tillhandahålls av libc6-udeb
-
- dep: libcvector2 (>= 1.0.3)
- ANSI C implementation of dynamic arrays
Hämta libcneartree7
| Arkitektur | Paketstorlek | Installerad storlek | Filer |
|---|---|---|---|
| amd64 | 26,6 kbyte | 89 kbyte | [filförteckning] |