tone: “gray-scale”
For well-distributed points, nearest neighbor search is often near O(logn)O(\log n)O(logn) in practice. In the worst case (all points clustered tightly or along a line), it can degrade to O(n)O(n)O(n), but this is uncommon with typical spatial data.
，详情可参考heLLoword翻译官方下载
"They're just really, really great people and fun," she said.，更多细节参见同城约会
Natural Neighbour Interpolation