Algorithm to find for all points in set A the nearest neighbor in set B

Question

Suppose we have two sets of points A, B, and we want to find for every point in set A its nearest neighbor in set B.

There are many good algorithms to find the near

Answer 1

A brute force solution could be to use a dendogram of closest points of set B. Then compare each point of set A to the dendogram. You can also create the dendogram with a delaunay triangulation.