出典:Wiktionary
出典:『Wiktionary』 (2025/06/08 04:12 UTC 版)
出典:Wikipedia
出典:『Wikipedia』 (2011/06/25 09:52 UTC 版)
In computer science, a k-d tree (short for k-dimensional tree) is a space-partitioning data structure for organizing points in a k-dimensional space. k-d trees are a useful data structure for several applications, such as searches involving a multidimensional search key (e.g. range searches and nearest neighbour searches). k-d trees are a special case of binary space partitioning trees.