I have two groups of three curves. These curves have all different lengths. I divide them. And so I end up with different number of points in each curve.

I want to perform a shortest list withing each group. So that the poly lines I create always have three points.

Frustrating problem! Can it be done without âPath Mapperâ (twice!)? This sort of thing happens all the time. It would be so helpful if âFlip Matrixâ was âsmarterâ and flipped each âlimbâ of the tree, where each limb has three branches. This kind of thing shouldnât be so hard.

P.S. This gets the lines but loses the grouping at the âPShiftâ just before âFlipâ. So closeâŚ

This solution uses an Anemone loop to preserve âgroupingâ of the horizontal lines. Ridiculous? Absolutely. More so than two âPath Mappersâ? Thatâs debatable. I donât know if there are any advantages to either approach(?), other than this one is easier for me to comprehend.

the points arenât here (though they could be if you show ControlPoints on the copied polylines)âŚ
it finds the shortest line of each group then copies a polyline the appropriate amount of times for that distance.

Avoid trouble whenever possible - good idea. Doesnât work with curves though.

By the way, I ran into a variation of this same âflip limbsâ problem while adding a âdata setâ group. In the âbendâ group, I want to use âInterpolate (IntCrv)â instead of âArcâ but donât see a way to accomplish that while preserving the original tree/limb grouping of lines/curves?