Vectors problem

Hi guys!

I need to find the minimum distance between two points.
For instance, I have two files composed by the initial and the final coordinates (x,y,z).
I find the distances (as Euclidean one) and then I find the minimum distance.
How can I know which the initial and final coordinates corresponding to the minimum distance are???
Furthermore, how can I remove this couple of coordinates from the two catalogues?

Thank you.
In other words, you do have two sets of points, A and B, and you want to find the closest pair (Ai, Bj). Logically, you should keep track of the (best-i,best-j) too.
Topic archived. No new replies allowed.