k-closest Pairs Query Algorithm Based on Hilbert Curve
Hao Zhong-xiao · Jisuanji gongcheng · 2008
Utilizing clustering quality of Hilbert curve,this paper presents definitions of reducing dimensionality,gives an algorithm to query k-closest pairs based on Hilbert curve,and proves the correctness of it. It can delete useless points in point set to optimize scanning procedure and reduce running time. According to the experiment,the algorithm is better than sequential-scan method.