Hi All,
I was wondering if someone had any suggestions/references/snippets
of code on how to find the minimum distance between 2 paths in 3D.
Basically, for every path, I have I series of points (x, y, z) and I
would like to know if there is a better way, other than comparing
point by point the 2 paths, to find the minimum distance between them.
Any suggestion is welcome :-)
Thank you.
Andrea.
"Imagination Is The Only Weapon In The War Against Reality."
http://xoomer.alice.it/infinity77/
_______________________________________________
Numpy-discussion mailing list
[email protected]
http://projects.scipy.org/mailman/listinfo/numpy-discussion
