bn:00915057n
Noun Concept
Categories: Database index techniques, Geometric data structures, Trees (data structures), Articles with short description, Data types
EN
k-d tree  Kd tree  Extended k-d tree  k-dimensional tree  K d-tree, k -dimensional tree
EN
In computer science, a k-d 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 . k-d trees are a special case of binary space partitioning trees. Wikipedia
Definitions
Relations
Sources
EN
In computer science, a k-d 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 . k-d trees are a special case of binary space partitioning trees. Wikipedia
A data structure in computing Wikipedia Disambiguation
Multidimensional search tree for points in k dimensional space Wikidata
A space-partitioning data structure for organizing points in a k-dimensional space, used in search algorithms etc. Wiktionary
DISCOVERER OR INVENTOR
Wikipedia
Wikidata
Wiktionary
Wikipedia Redirections