netWork

Replies to This Discussion

Permalink Reply by RWNB on April 2, 2012 at 3:50am

hi tudor,

thanks a lot for sharing. i play a little with your def.
it is interesting, but i don't really understand it...

i've created a grid of points. see the picture.
and have selected four symmetrical points,
from there the lines should grow up.
the resulting pattern is still very irritating?
is there also analyzis from this work,
and would you kommunicate the results?

thanks in advance

Permalink Reply by Mateusz Zwierzycki on April 2, 2012 at 4:29pm

I belive that it is somehow related to diffusion limited aggregation. "Growth" direction is not so obvious with small amount of "branches"

If you want, I will send you some little script of mine, that produces a strict DLA effect (works both in 2 and 3d, also with curves and points) (pm me if youre interested)

Permalink Reply by Gavin on April 14, 2012 at 2:10pm

Hey Mateusz, i would love to see your script if is still available.

 

Regards,

 

Gavin

Permalink Reply by Marcus Holmgren on April 25, 2013 at 12:40pm

can u email me some of the DLA scripts too, plz! :)

Permalink Reply by Tudor Cosmatu on April 3, 2012 at 3:25pm

hello RWNB,

Your problem is that the pattern is not symmetrical (given that the chosen points are)?

Permalink Reply by Tudor Cosmatu on April 3, 2012 at 3:31pm

I'm going to explain what the recursive algorithm is doing based on this image. for each of the starting points it is searching for 2 (0,1) points within the designated/desired distance. As long as there are points within that distance, he keeps repeating the same action again and again, branching each time (if possible) with the maximum number (2). With each step, it is removing points that fall within the search radius. What do you mean with the lines should grow up?

Permalink Reply by RWNB on April 4, 2012 at 3:32am

hi tudor,

ok, i try to illustrate my request!
i have two lists of points.
these are to be connected with lines.
the line should be drawn in dependence on the distance.
see the graphics.

thanks

this pattern i get with your tool!

Permalink Reply by Tudor Cosmatu on April 4, 2012 at 2:36pm

Hi RWNB,

From the diagrams i understand that u would want something that is connecting points, always taking into consideration the distance from the center (starting point) to the target points.

The script i wrote there is not working like that. It s always returning the closest n points from each of the n points * repetition he found in the previous run. To be more speciffic, if in the first run it finds 2 points (and you are asking him for 2 points) it then connects the starting point with the 2 found points, and then treats them as new "centers"(new starting points) repeating the process over and over. If the maximum distance between the last connected points and the next (to be connected) points, is bigger then the required distance(the distance you can set as input) the script stops searching for points.

Also in addition to this, each time it's searching for points there might be the case that it is finding more then the requested max number of points (to be connected). If that's the case, all the points that were within the given radius, but to which it didn't create any line, get discarded - that's also why you get those weird results. :)

Permalink Reply by RWNB on April 5, 2012 at 3:07am

anyhow, many thanks.

Permalink Reply by Margherita Valle on October 14, 2013 at 11:01pm

there is any form to connect points in a grid?