I'm looking for effective algorithm or at least possible english term to name it
for google. I have array A with set of points. I have array B with other set of
points. For each point from array A I need nearest point in array B. The
question is what structure and additional data I should use for array B to make
this finding fastest. The structure should be aplicable for any not sorted set
of points in array A.

ABX

Post a reply to this message