# Python-KD-Tree

**Repository Path**: githjk/Python-KD-Tree

## Basic Information

- **Project Name**: Python-KD-Tree
- **Description**: A damm short KD-tree for points in Python for kNN or nearest points. (just ~50 lines)
- **Primary Language**: Python
- **License**: Not specified
- **Default Branch**: master
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 0
- **Created**: 2020-03-14
- **Last Updated**: 2021-11-03

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README

Python KD-Tree for Points
=========================

A damm short kd-tree implementation in Python.
- `make_kd_tree` function: 12 lines
- `get_knn` function: 21 lines 
- `get_nearest` function: 15 lines

No external dependencies like numpy, scipy, etc...
and it's so simple that you can just copy and paste, or translate to other languages!

Your teacher will assume that you are a good student who coded it from scratch.

Just star this project if you find it helpful... so others can know it's better than those long winded kd-tree codes. ;)