BabelNet

bn:00915057n

Noun Concept

k-d δέντρο kd-δέντρο

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

Relations

Sources

IS A

δομή δεδομένων

DISCOVERER OR INVENTOR

Jon Bentley

Wikipedia Translations

k-d δέντρο, kd-δέντρο