Python Algorithm: Frei Otto Wool Thread Experiments

[Lei_Yang1 (Lei Yang)]

Hello guys,

anyone knows where find the python code about simulating ‘Frei Otto Wool Thread Experiment’?

Thanks,
Lei

[tim.stark]

Look up for „wooly paths“ or „edge bundling“ on google or the old/new gh forum. There are some scripts around. I know there are c#‘s maybe also phyton. Maybe you can translate the c# to phyton

[Lei_Yang1 (Lei Yang)]

Thanks Tim!

[Lei_Yang1 (Lei Yang)]

Hi Tim,

Found one of your post Nov, 2017.

From edge bundling / wooly paths to surface between

Hello everyone, I got a bunch of nurbs out of an edge bundling (every point connected with all other Points). Now I want the area between them. Michael Pryor told me that the best way is by splitting a surface with the curves. But yeah, splitting is slow and my computer is not able to calculate that with this amount of curves. Is there a way to reduce the lines? I also thought about makeing a really small metaball around them so I can split with fewer lines? I just don’t know how to go on. I…

what I am doing, well… I think has similarity of yours, which is create a urban network based on certain algorithm. I tried Wooly Path, however, maybe its my problem, I found wooly path logic of creating pattern in a quite random way. So I turn to Bundling Path logic and found KDE(Kernel Density Estimation by @Laurent Delrieu). Anyhow, curious about whether you r still in the reaserch of network creation and if possible, what you think of KDE implementation on the urban planning level and how reasonable it is?

Thanks again!
Lei