https://github.com/begeekmyfriend/kdtree

Absolute balanced kdtree for fast kNN search.
https://github.com/begeekmyfriend/kdtree

algorithm k-means k-nearest-neighbours kd-tree kd-trees kdtrees kmeans knn knn-search tree-structure

Last synced: 12 days ago
JSON representation

Absolute balanced kdtree for fast kNN search.

• Host: GitHub
• URL: https://github.com/begeekmyfriend/kdtree
• Owner: begeekmyfriend
• License: mit
• Created: 2017-02-22T09:43:44.000Z (about 8 years ago)
• Default Branch: master
• Last Pushed: 2023-09-13T00:58:08.000Z (over 1 year ago)
• Last Synced: 2023-11-07T22:19:32.049Z (over 1 year ago)
• Topics: algorithm, k-means, k-nearest-neighbours, kd-tree, kd-trees, kdtrees, kmeans, knn, knn-search, tree-structure
• Language: C
• Homepage:
• Size: 28.3 KB
• Stars: 170
• Watchers: 13
• Forks: 35
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# 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).