bounded-kd-tree

This library has functionality for sorting and querying data in a [KD Tree](https://en.wikipedia.org/wiki/K-d_tree) like structure. KD Trees are typically constructed by starting with a relatively large amount of data. Possibly all of the data that's int

kd-shim-canvas-loader

shim repository for [CanvasLoader](https://github.com/heartcode/CanvasLoader/commit/8c1e010cde4cf630254e42d415af06e449fca21e).