A kd-tree data structure, for efficiently querying large collections of points in Euclidean space (e.g. for nearest-neighbour searches).