• k-d tree
• k-d trees

k-d tree (suomeksi)

Määritelmät:

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