Keywords

#k-d_tree

K-d tree

Multidimensional search tree for points in k dimensional space

In computer science, a k-d tree is a space-partitioning data structure for organizing points in a k-dimensional space. K-dimensional is that which concerns exactly k orthogonal axes or a space of any number of dimensions. k-d trees are a useful data structure for several applications, such as:Searches involving a multidimensional search key & Creating point clouds.

Thu 23rd

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

K-d tree K-D-B-tree Relaxed k-d tree Adaptive k-d tree Implicit k-d tree Range tree List of data structures R-tree Hierarchical navigable small world BK-tree
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.