nanoflann: a C++11 header-only library for Nearest Neighbor (NN) search with KD-trees
-
Updated
Aug 24, 2024 - C++
nanoflann: a C++11 header-only library for Nearest Neighbor (NN) search with KD-trees
Scalable Nearest Neighbor Algorithms for High Dimensional Data
Header-only C++ K-d tree library
Projecte de l'assignatura d'algorismia de la FIB, Q1 2023-2024
nanoflann: a C++11 header-only library for Nearest Neighbor (NN) search wih KD-trees
This implementation creates a KDTree object using a vector of Point3D objects, and then searches for the nearest neighbor to a query point using the nearestNeighbor function. The nearestNeighbor function uses a recursive search algorithm to traverse the kd-tree and find the closest point to the query point.
Add a description, image, and links to the kd-trees topic page so that developers can more easily learn about it.
To associate your repository with the kd-trees topic, visit your repo's landing page and select "manage topics."