I really can’t reproduce this behavior. In fact, I think that is the reason why you can send a variable by reference using ‘&’. That works for me …

??!! How can a function corrupt the original data? I can’t see this behavior.

Or by pivot+1

Hi Jorge. No, the first item wasn’t an improvement of your code (I’m not able to do that), it’s just a way to pre-store neigthbors so you can search f…

PolyTools3D: Here is one of the many “hard cases” to solve. It can be solved, but I can’t figure out a logic for a 1 or 2 passes solution for it. T…

I really still don’t understand what do you need… How many loops should you get in this schema? 2 closed unconnected loops? (then 2 valid solutions…

I see … I did not quite understand your requirements. But my routine seems to work fine and fast for its purpose!

Please, DenisT, before saying that the routine is not correct, read its conditions: “it’s only valid for unconnected loops, closed or not” In your exa…

Same version but inserting items backwards instead of reversing and joining (for opened loops). Really can’t find any performance difference, so this …

This new version seems to work in all cases, for paths of unconnected edges (closed or not). Time for first Torus example (25 loops of 100 edges): 105…

PolyTools3D: I wonder if it could be modified to work with opened loops as well. For example, from the torus test remove one edge in each loop. I…

Here’s a new version that works for the three examples of closed-unconnected loops (and hope for all cases). It takes 99ms instead of 90ms for the fir…

Yes, you are right. I can’t take advantage of triangularization the way I’ve done. I’ll think a little more…

Reading a little of Graphic Schema Theory, I have found a method -using something similar to an Adjacency Matrix that becomes triangular- that gives t…

Perhaps this thread can give you some idea: