我已经实现了一个decode/encode
方法,用来将 2D 点转换为它们相应的 morton code
。
我要找到最近的邻居(在一个min_distance
下)。例如,像这样:
points=[(200,300),(500,150),(100,50)]
mortonCodes = {}
for p in points:
mortonCodes[encode(p)] = p
nearest = findNearestNeighbor(mortonCodes, (201,305))
print(nearest) # ---> should return (200,300)
可以吗?