A Simple Unbalanced KDTree with 1NN Implementation

Abstract

This code is a reformulation of the kd-tree datastructure, useful in k-nearest neighbor algorithms. Besides tradition binary-tree sorting mechanisms (e.g. red-black or AVL trees), the kd-tree maintains the added feature of sorting on dimension. This process enables O[log(n)] read/write speeds after data intake - a very efficient method for searching a massive amount of data.

This code includes a use case.

As of May 3rd, 2018, this code is positively rated on Stack Exchange and has been favorited by users.

Note: continued work on this project has been cancelled in favor of using already established data structures for leveraged analysis. There is no GitHub page for this code, but a copy remains on the original Stack Exchange Post.

Author(s)

Wyatt "Miller" Miller

Similar Projects

---

---