Calculate Mapping of Nearest Points of 2 matrices?

If so, Matlab has a built-in function that computes the smallest-norm transformation that brings the points into alignment (this is the Procrustes distance).

Up vote 1 down vote favorite share g+ share fb share tw.

I have two matrices A and B. Each of them has 2 columns having the coordinates of a point ( x , y ). I need to compute a mapping of points from A to B such that the points have least euclidean distance among them.

Thus for all points in A, I compute euclidean distance with all points in B and then remove the mapping of 2 points which have the least distance. Then I continue to do this until A and B are both empty. Could someone tell me what could be the most efficient way of doing this?

Matlab link|improve this question asked 40 mins agoanon475 71% accept rate.

I have asked very similar question before. The only difference - I had vectors and you have matrices. Anyway the solution should be very similar.

Have a look: Mapping 2 vectors - help to vectorize – yuk 17 mins ago.

If so, Matlab has a built-in function that computes the smallest-norm transformation that brings the points into alignment (this is the Procrustes distance). See this documentation for how to use it. If you don't have the Statistics Toolbox, then you should check the Matlab Central File Exchange first to see if anyone's written a non-toolbox version of the procrustes() function before seeking to write your own.

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.