alla flaggor
buster  ] [  bullseye  ] [  bookworm  ] [  trixie  ] [  sid  ]
[ Källkod: neartree  ]

Paket: libcneartree-dev (5.1.1+dfsg1-2.1 och andra)

Länkar för libcneartree-dev

Screenshot

Debianresurser:

Hämta källkodspaketet neartree:

Ansvariga:

Externa resurser:

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.

Märken: Software Development: Bibliotek, Role: Development Library

Andra paket besläktade med libcneartree-dev

  • beror
  • rekommenderar
  • föreslår
  • enhances

Hämta libcneartree-dev

Hämtningar för alla tillgängliga arkitekturer
Arkitektur Version Paketstorlek Installerad storlek Filer
riscv64 5.1.1+dfsg1-2.1+b1 119,4 kbyte1.226,0 kbyte [filförteckning]