nanoflann: a C++11 header-only library for Nearest Neighbor (NN) search with KD-trees
-
Updated
Aug 25, 2026 - C++
nanoflann: a C++11 header-only library for Nearest Neighbor (NN) search with KD-trees
Absolute balanced kdtree for fast kNN search.
CUDA based Iterative Closest Point Algorithm Implementation
Policy Iteration for Continuous Dynamics
Built text and image clustering models using unsupervised machine learning algorithms such as nearest neighbors, k means, LDA , and used techniques such as expectation maximization, locality sensitive hashing, and gibbs sampling in Python
Scalable Nearest Neighbor Algorithms for High Dimensional Data
An efficient Nearest Neighbor Classifier for the MINST dataset. It uses a VP Tree data structure for preprocessing, thus improving query time complexity
Header-only C++ K-d tree library
Containing all the coding projects and assignments I've completed in COS 226 @ Princeton (Data Structures & Algorithms)
Answers to assignments for Princeton University Algorithm Course
PlagueSpread is a Computational Geometry application, with the scenario of infection spread from hotspot areas. It concerns 2D, 3D space, Voronoi Diagrams, KD trees, Path finding and terrain emulation, among others.
This library contains some of the Advanced Data Structures such as van Emde Boas trees, Suffix Trees, Fibonacci Heaps and other data structures
nanoflann: a C++11 header-only library for Nearest Neighbor (NN) search wih KD-trees
Algorithms, Part I by Princeton University assignments
Projecte de l'assignatura d'algorismia de la FIB, Q1 2023-2024
To associate your repository with the kd-trees topic, visit your repo's landing page and select "manage topics."