algorithmic modeling for Rhino
I am having some trouble with a data structure. Would be glad if anyone could give me a hint:
I am trying to get the shortest walk through a set of intersecting lines.
This works if the input is ONE flat set of lines. however I want to modify this so it works with multiple sets of lines.
This should be possible shouldn't it?
see files attached for refrence:
the first example works fine when I combine two sets of lines
But I want this to work with basically an infinite amount of lines from one data tree with sub-sets.
thanks for any help!
Attach your definition please.
shortest walk with multiple sets of intersecting/crossing curves:
Sorry, my input data was messed up. (doh) thats why it didn't work.
apologies if anyone spent time on this!
I seem to be having a similar problem but i have struggled to fix it does anyone think they can help?
I have attached my definition etc