But I had the impression that you are a man devoted to find the Truth Out There, he he.
Anyway here’s a challenge with regard Laurent’s approach: Obvioulsy the only way to deal with self ccx curves is to split them (at the self ccx t values). But even so … there’s several situations where it’s hard (or impossible) to pick the right loop (it’s a bit kinda reverse engineering where the train is departed and you are waiting for some other [he’ll never come]). There’s also several cases where all-well + no self ccx means 100% bananas. Here’s one:
Tip: Locate a mess offset (not that difficult with the settings as in V2), place a point inside the donor poly , get the index and the offset thingy … and try to find the truth out there (but there’s none). DO NOT sort the loops with regard the distance between their CoG and the donor poly CoG (on first sight appears to be the solution - but life sucks).
PS: Recursion is required here in order to test properly ccx events (on the moved inwards/outwards segments) between a current, a next and a nextnext segment. If the dot between the next.Direction and the ccx current-next and next-nextnext is < 1 (inversed result: no-no) it means that it’s time to date another girl (set next == nextnext and keep trying) . I’ll post a derestricted abstract demo on that matter later. Kinda stuff the likes:
PS: Use the same R file posted above for that V2.
variableOffset_LaurentD_and_TheLord_V2.gh (140.2 KB)