Key points are not available for this paper at this time.
Nearest neighbor graphs are widely used in data mining and machine learning. A brute-force method to compute the exact kNN graph takes Θ(dn2) time for n data points in the d dimensional Euclidean s...
CHENJie et al. (2009) studied this question.