nanoflann
KD tree library
A C++ library for efficient nearest neighbor search with KD-trees
nanoflann: a C++11 header-only library for Nearest Neighbor (NN) search with KD-trees
2k stars
84 watching
490 forks
Language: C++
last commit: 17 days ago
Linked from 2 awesome lists
c-plus-pluscppkd-treesnanoflannpoint-clouds
openmvg/awesome_3dreconstruction_list
p-ranav/awesome-hppRelated projects:
| Repository | Description | Stars |
|---|---|---|
 norlab-ulaval/libnabo | A fast K Nearest Neighbor library for low-dimensional spaces | 447 |
 kristofferc/nearestneighbors.jl | A Julia package for efficient nearest neighbor searches in high-dimensional spaces | 426 |
 whenever5225/graphanns | An implementation of graph-based approximate nearest neighbor search algorithms | 31 |
 libfann/fann | A C++ library for building and training artificial neural networks | 1,594 |
 kmc7468/cppdnn | Provides machine learning capabilities in C++11 | 9 |
 rlidwka/node-fann | Bindings for a neural network library in C++ to be used with Node.js | 185 |
 nanodbc/nanodbc | A C++ wrapper simplifying interaction with the native ODBC API | 339 |
 jtsiomb/kdtree | An efficient C library for storing and searching k-dimensional data using a tree-like data structure | 395 |
 yixuan/minidnn | A C++ library implementing deep neural networks with good performance and modularity | 397 |
 attractivechaos/kann | A lightweight C library for constructing and training small to medium neural networks with customizable architecture | 686 |
 src-d/kmcuda | Optimized K-means and K-nn implementation using NVIDIA CUDA with low memory consumption | 806 |
 torch/nngraph | Graphical computation library for building neural network architectures | 299 |
 100/cranium | A lightweight, portable C implementation of a feedforward artificial neural network library | 592 |
 felipexw/knn-java-library | An implementation of a K-Nearest Neighbor algorithm for supervised learning | 7 |
 yahoojapan/ngt | A library for efficient searching of high-dimensional data points using graph and tree-based methods | 1,258 |