k-d tree

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English[edit]

English Wikipedia has an article on:
Wikipedia

Etymology[edit]

Short for k-dimensional tree.

Noun[edit]

k-d tree (plural k-d trees)

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