Kd tree
Multidimensional search tree for points in k dimensional space / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Kd tree?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
In computer science, a kd tree (short for kdimensional tree) is a spacepartitioning data structure for organizing points in a kdimensional space. Kdimensional is that which concerns exactly k orthogonal axes or a space of any number of dimensions.[1] kd trees are a useful data structure for several applications, such as:
 Searches involving a multidimensional search key (e.g. range searches and nearest neighbor searches) &
 Creating point clouds.
Multidimensional search tree for points in k dimensional space
kd tree  

Type  Multidimensional BST  
Invented  1975  
Invented by  Jon Louis Bentley  

kd trees are a special case of binary space partitioning trees.
Oops something went wrong: