最終更新日：2024/08/05

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

正解を見る

k-d tree

問題を編集する

元となった辞書の項目

k-d tree

noun

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

A k-d tree is a data structure that partitions space into regions.

意味（1）

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