I don't know if it sounds clever but, if your two sets of points are nearly identical then you can sort them according to one of the coordinate axis then the lists are matched automatically. And to let the algorithm to work on symmetrical models, you can sort them according to all the three axis. And I think because Python has a fast sorting function it is a good solution.
I've used this approach in one of my plugins in which I need to search for symmetrical points in a mesh to create mirrors of a blendshape. On 11 Aug 2010 04:35, "Ofer Koren" <[email protected]> wrote: The Maya API provides the *MMeshIntersector *class for optimized lookup of the closest point on a mesh. There's also the *closestPointOnMesh/Surface* node that you could use. I also recall an equivalent mel command but that required an external plugin. A simple loop over all point coords would work, but could be extremely inefficient and slow - for each given point you will have to go through *all *to find the closest one. - Ofer www.mrbroken.com On Tue, Aug 10, 2010 at 2:00 PM, Alan Fregtman <[email protected]> wrote: > > Hi guys, > > ... -- http://groups.google.com/group/python_inside_maya -- http://groups.google.com/group/python_inside_maya
