Anyone knows if there's a maxscript out there that will select a ring that's the shortest distance between two edges? I tried writing it myself, but it's going over my head. Can't figure out how to select the parallel edge of an edge selection.
How would you iterate through the edges though? When you call ring and then get the current selection, it just gives you a list of edges sorted by the edge-number. So I have no way of knowing if one edge is the next one up in the ring, or just some random edge in that ring.
1. Get Endverts of 1 selected edge 2. Get all edges connected to the endverts 3. Get all endverts of this edges 4. determine which of these verts form a new edge as a pair 5. save the pair(you will most likely get 2 pairs, one in each direction) 6. do the same procedure again for the edges between the vert-pairs, except…
I think it was something like: 1.get all edges connected to the endpoints of first selected egde 2.substract all edges which form the both surrounding polygons ->What you get is the first step in the ring between 2 selected edges if you continue till you hit the other selected edge you are done with the ring between the 2…
Thanks for that dude. I ended up writing it just for fun, but it's turning into a huge piece (~100 lines now) for something that the IC.shape script does better. The good news is that it actually does work pretty well. But only on a simple cylinder shape. If there are poles, then it throws the whole thing off. And I gotta…