All Projects → begeekmyfriend → Kdtree

begeekmyfriend / Kdtree

Licence: mit
Absolute balanced kdtree for fast kNN search.

Programming Languages

c
50402 projects - #5 most used programming language

Projects that are alternatives of or similar to Kdtree

Data structure and algorithms library
A collection of classical algorithms and data-structures implementation in C++ for coding interview and competitive programming
Stars: ✭ 133 (+1.53%)
Mutual labels:  algorithm, tree-structure
Machine learning basics
Plain python implementations of basic machine learning algorithms
Stars: ✭ 3,557 (+2615.27%)
Mutual labels:  algorithm, kmeans
Graphview
Flutter GraphView is used to display data in graph structures. It can display Tree layout, Directed and Layered graph. Useful for Family Tree, Hierarchy View.
Stars: ✭ 152 (+16.03%)
Mutual labels:  algorithm, tree-structure
Go Algorithms
Algorithms and data structures for golang
Stars: ✭ 1,529 (+1067.18%)
Mutual labels:  algorithm, tree-structure
Data Structure Php Clanguage
对于数据结构和算法类的东西,我工作有些年份了,大学也有所涉猎,积累了一些内容,不高产不母猪,打我自己脸
Stars: ✭ 299 (+128.24%)
Mutual labels:  algorithm, tree-structure
Bplustree
A minimal but extreme fast B+ tree indexing structure demo for billions of key-value storage
Stars: ✭ 1,598 (+1119.85%)
Mutual labels:  algorithm, tree-structure
Awesome Data Science Viz
💥 📈 A curated list of data science, analysis and visualization tools
Stars: ✭ 124 (-5.34%)
Mutual labels:  algorithm
Codezilla
⚡️ codezilla ⚡️ One giant 🦖 collection of algorithms & design patterns.
Stars: ✭ 127 (-3.05%)
Mutual labels:  algorithm
Closure tree
Easily and efficiently make your ActiveRecord models support hierarchies
Stars: ✭ 1,665 (+1170.99%)
Mutual labels:  tree-structure
Thealgorithms
Algorithms repository.
Stars: ✭ 122 (-6.87%)
Mutual labels:  algorithm
Qipai algorithm
棋牌的胡牌算法,包括麻将、跑胡子、扑克。实现 lua 、c++ 、c# 、golang 、js 、java 、python 版本。( Mahjong algorithm )
Stars: ✭ 1,705 (+1201.53%)
Mutual labels:  algorithm
Leetcode Editor
Do Leetcode exercises in IDE, support leetcode.com and leetcode-cn.com, to meet the basic needs of doing exercises.Support theoretically: IntelliJ IDEA PhpStorm WebStorm PyCharm RubyMine AppCode CLion GoLand DataGrip Rider MPS Android Studio
Stars: ✭ 2,222 (+1596.18%)
Mutual labels:  algorithm
Algorithms
📝 算法导论与JavaScript实现
Stars: ✭ 126 (-3.82%)
Mutual labels:  algorithm
Foundry
The Cognitive Foundry is an open-source Java library for building intelligent systems using machine learning
Stars: ✭ 124 (-5.34%)
Mutual labels:  algorithm
Pbtreeview
An UITreeView implementation from UITableView that Apple missed in its UIKit framework. And it is in pure Swift.
Stars: ✭ 128 (-2.29%)
Mutual labels:  tree-structure
Turf Swift
A Swift language port of Turf.js.
Stars: ✭ 123 (-6.11%)
Mutual labels:  algorithm
Leetcode Sol Res
Clean, Understandable Solutions and Resources for LeetCode Online Judge Algorithm Problems.
Stars: ✭ 1,647 (+1157.25%)
Mutual labels:  algorithm
Algs4 Py
A Python library for the textbook Algorithms, 4th edition
Stars: ✭ 122 (-6.87%)
Mutual labels:  algorithm
Bitmap
C++ Bitmap Library
Stars: ✭ 125 (-4.58%)
Mutual labels:  algorithm
Hackerrank
📗 Solutions of more than 380 problems of Hackerrank accross several domains.
Stars: ✭ 128 (-2.29%)
Mutual labels:  algorithm

kdtree

This is a (nearly absolute) balanced kdtree for fast kNN search with bad performance for dynamic addition and removal. In fact we adopt quick sort to rebuild the whole tree after changes of the 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 with the tree still kept balanced.

The thought of the implementation is posted here.

Note that the project description data, including the texts, logos, images, and/or trademarks, for each open source project belongs to its rightful owner. If you wish to add or remove any projects, please contact us at [email protected].