k-d tree

noun1

1. •
   A space-partitioning data structure for organizing points in a k-dimensional space, used in search algorithms etc.