kd-trees 开源项目推荐（21 个）

jlblancoc /nanoflann

nanoflann：一个仅C++11头的库，用于使用KD树进行最近邻（NN）搜索

begeekmyfriend /kdtree

Absolute balanced kdtree for fast kNN search.

chhavisharma /Project4-CUDA-ICP

CUDA based Iterative Closest Point Algorithm Implementation

agrawal-priyank /machine-learning-clustering-retrieval

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

CHoudrouge4 /SNNAHDD

Scalable Nearest Neighbor Algorithms for High Dimensional Data

matakshay /NN-Classifier-using-VPTree

An efficient Nearest Neighbor Classifier for the MINST dataset. It uses a VP Tree data structure for preprocessing, thus improving query time complexity

kokostek /kdtree

Header-only C++ K-d tree library

f1r3starter /kdtree

🌳PHP K-D Tree implementation

Ammaar-Alam /cos-226

Containing all the coding projects and assignments I've completed in COS 226 @ Princeton (Data Structures & Algorithms)

QQQQQby /Princeton-Algorithm-Assignments

Answers to assignments for Princeton University Algorithm Course

kosarx /PlagueSpread---ComputationalGeometry2024

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.

YaroslavKSE /Task_6

Kd-Tree

oguzkeremyildiz /Arcueid

This library contains some of the Advanced Data Structures such as van Emde Boas trees, Suffix Trees, Fibonacci Heaps and other data structures

telcy /kd-tree-rgb

KD-tree with RGB colors

svetozarv /algorithms-by-princeton-I

Algorithms, Part I by Princeton University assignments

joaquimgomez /FIB-LP-kd2nTreeHaskell

Implementation of Kd 2^n-Tree Structure for the Programming Languages subject.

RustedBytes /nanoflann

Safe Rust KD-tree port inspired by nanoflann's adaptor API

guillaumelauzier /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.

stotko /nanoflann

nanoflann: a C++11 header-only library for Nearest Neighbor (NN) search wih KD-trees

AleNarder /kd-tree

Simple kd-Tree interface implemented in C++