Awesome

Implementation of KdTree and Range Search

KdTree is a data structure that could be used to find data in a particular range efficiently.

The implementation of KdTree could be found here

The article for this repo could be found here

An example of KdTree

To visualize the data structure of KdTree on a real dataset, I use a dataset for locations of ECOBICI’s stations (Mexico’s City bike public sharing system). To observe the structure, clone this repo then run

python ecobi.py

To find data in a particular range, run

python findrange.py

Enter the range in the prompt to retrieve the data.