KO
|
EN
gitlite — search
Search
#python
#javascript
#typescript
#flutter
#react
#cpp
#dart
#library
#android
#docker
#ubuntu
#ios-swift
kdtree
★ 180
Open GitHub ↗
Absolute balanced kdtree for fast kNN search.
Download README (.md)
Explore Similar Repositories
100-words-design-patterns-java
:
GoF Design Patterns, each pattern described with story from real life.
kirk
:
A highly-flexible thread pool for Rust
epoll_threadpool
:
A small, clean, linux-only thread-pool implementation using epoll with support for sockets, scheduled callbacks and TCP connections.
IdentityServer4-Example
:
Example IdentityServer4 & Duende IdentityServer implementation.
php-gcm
:
An easy to use gcm library for PHP
// repository documentation
Was this content helpful?
★ 0
(0 ratings)
Select Rating:
★
★
★
★
★
Submit Feedback
Recent Feedback
×
Download README
Do you want to download the
README.md
file for
kdtree
?
Download (.md)
# kdtree This is a (nearly absolute) balanced kdtree for fast kNN search. It does not support dynamic insertion and removal. Actually we adopt quick sort to rebuild the whole tree after changes of nodes. We cache the added or the deleted nodes which will not be actually mapped into the tree until the rebuild method to be invoked. The good thing is we can always keep the tree balanced, and the bad thing is we have to wait some time for the finish of tree rebuild. Moreover, duplicated samples are allowed to be added. The thought of the implementation is posted [here](https://www.joinquant.com/post/2843). ## how to debug $ mkdir build $ cd build $ cmake .. $ make $ ./kdtree 1234 # you can try different seed number for random sample generations <img width="552" height="589" alt="Image" src="https://github.com/user-attachments/assets/2e003772-e441-4923-9e3e-80c769557abd" />
