Что думаешь? Оцени!
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.，这一点在雷电模拟器官方版本下载中也有详细论述
modified version of one of the LUCIFER implementations called DSD-11. Through，这一点在爱思助手下载最新版本中也有详细论述
Флорида Пантерз。Line官方版本下载是该领域的重要参考