k-d tree

名词 n.
中文释义

英文释义

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

词形变化

k-d trees plural

词源

Short for k-dimensional tree.
0 次浏览 数据来源: Wiktionary