k-d tree

Noun

Meaning

k-d tree (plural k-d trees)

(computing) A space-partitioning data structure for organizing points in a k-dimensional space, used in search algorithms etc.

Close letter words and terms