Some clever algorithms might find the closest match faster, like quadtrees or binary space partitioning.

一些聪明的算法可能会发现最接近的匹配速度快，像四叉树或二进制空间分割。

youdao

Edit 2: I looked at binary space partitioning 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.

编辑2：我看了看二进制空间划分为实现这一目标的一个选项，但我只找到一个实现(在GL2PS)，我不知道如何使用。

youdao

Edit 2: I looked at binary space partitioning 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.

编辑2：我看了看二进制空间划分为实现这一目标的一个选项，但我只找到一个实现(在GL2PS)，我不知道如何使用。

youdao