k-d tree

English

Etymology

Short for k-dimensional tree.

Noun

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.
This article is issued from Wiktionary. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.