create a default polySphere in a new scene and run these two lines:
import pymel.core as pm pm.polySelect( 'pSphere1', shortestEdgePath=(274, 260) ) You'll see shortestEdgePath finds a route that isn't a straight line between the two verts. On Tue, Oct 23, 2012 at 3:10 PM, Jesse Capper <[email protected]>wrote: > How is the calculation of shortestEdgePath flawed? It's worked in the > situations I've tried it, though they certainly haven't been exhaustive. > > > On Tuesday, October 23, 2012 6:35:12 AM UTC-7, charles le guen wrote: >> >> Hi guys >> >> Any idea how to select and store an ordered list of verts along a portion >> of a contiguous edge? >> >> In other words: >> *Given two selected vertices (vert1 and vert2) on a contiguous edge, >> select all of the verts from vert1 to vert2 (inclusive) and store them in >> that order for future manipulation*. >> >> That would allow one to do stuff to them (such as create a joint chain >> snapped to those points, create cloth constraints along those points, etc). >> >> Right now it's easy to select the edges manually and convert that >> selection to verts and then run scriptX. The problem with that >> semi-automated process is that the order of verts isn't in a straight line >> from vert1 to vert2. >> >> Maya has a command called shortestEdgePath, but it seems to be flawed in >> how it calculates the shortestEdgePath (and since it selects an edge path >> rather than an ordered set of verts, even if it worked well, it still >> wouldn't produce the result I'm looking for) >> >> Thanks for any ideas you may have to share >> C >> >> -- > view archives: http://groups.google.com/group/python_inside_maya > change your subscription settings: > http://groups.google.com/group/python_inside_maya/subscribe > -- view archives: http://groups.google.com/group/python_inside_maya change your subscription settings: http://groups.google.com/group/python_inside_maya/subscribe
