2 citations · 2 across the 1 of their papers we have counts for
1 paper
Dan Gao, Yanxia Zhang, Yongheng Zhao
The basic idea of the kd-tree algorithm is to recursively partition a point set P by hyperplanes, and to store the obtained partitioning in a binary tree. Due to its immense popula…