Some clever algorithms might find the closest match faster, like quadtrees or binaryspacepartitioning.
一些聪明的算法可能会发现最接近的匹配速度快,像四叉树或二进制空间分割。
2
Edit 2: I looked at binaryspacepartitioning as an option of achieving this but I have only been able to find one implementation (in GL2PS), which I'm not sure how to use.