KD Trees are quite useful as data structures to organize points in k dimensional space, and are particularly useful for multidimensional search. Such optimizations could save lots of computing power.
https://en.wikipedia.org/wiki/K-d_tree
tanmayghai18
In addition to @shivamparikh's comment above, KD-Trees remind me of another data structure: 61B. For our purposes, such trees are really cool for storing stuff in higher dimensions than other trees we have seen previously. Furthermore, I found a really cool application of them online using K nearest-neighbors on a KD-Tree: https://blog.krum.io/k-d-trees/
keirp
KD-Trees are also used in ML context for finding nearest neighbors to certain data points.
KD Trees are quite useful as data structures to organize points in k dimensional space, and are particularly useful for multidimensional search. Such optimizations could save lots of computing power. https://en.wikipedia.org/wiki/K-d_tree
In addition to @shivamparikh's comment above, KD-Trees remind me of another data structure: 61B. For our purposes, such trees are really cool for storing stuff in higher dimensions than other trees we have seen previously. Furthermore, I found a really cool application of them online using K nearest-neighbors on a KD-Tree: https://blog.krum.io/k-d-trees/
KD-Trees are also used in ML context for finding nearest neighbors to certain data points.