SpiderWeb V3.0

Replies to This Discussion

Permalink Reply by Daniel Piker on December 27, 2012 at 8:45

Been playing around with this and it's a really neat tool!

I was (mis)using the Minimal Spanning Tree component for generating this sort of venation pattern, and it makes it very easy - just 4 components!

I found it interesting how the result looks so similar to the results of Diffusion Limited Aggregation algorithms despite the very different techniques.

Also - I was recently trying some of my own graph generation experiments here, and I found that the Incidence List format I am using is compatible with SpiderWeb :

Attachments:

• veins.gh, 9 KB

Permalink Reply by Ángel Linares on December 27, 2012 at 15:25

Nice test! Mmmm...and tool :)

Permalink Reply by Richard Schaffranek on January 8, 2013 at 3:54

Hallo Daniel,

Sorry for the late replay holidays where really needed so no internet...

Yes they looked very similar, but I guess they will have very different properties at the end. As fare as I understand diffusion Limited Aggregation would allow for connecting to "branches" forming something like a "loop". 

I really like your component, I am working on large scale street - networks at the moment an this is rely helpful, is it possible to pass different tolerances i.e.: snapping lines, new intersection, straitening lines, .... 

The Delaunay triangulation component also uses the same incidence List format. 

In your other example you also show an edge representation (which is missing in the component) of a Graph which will be a next thing to add to Spiderweb because there are slight problems with the "ShortestPathAngular" component calculations are right but I figured there is a problem with the Graph returned due to the incidence List format. 

As fare as I understand you are more interested in structure, would be nice to see what can be done with graphs in this field.

Richard

Permalink Reply by Mariana Schetini Basso on January 30, 2013 at 13:31

Hi Daniel, how could I put this over a non-linear surface???

Permalink Reply by Richard Schaffranek on January 30, 2013 at 13:36

What do you mean by applying it to a nonlinear surface?

i.e. if all the  points are in the domain between 0 and 1 than you can remap the points on the surface. 

Permalink Reply by Mariana Schetini Basso on January 30, 2013 at 20:24

Oh sorry I said Daniel I'm confused =) Richard

I mean not planar surface, like a sphere in this picture:

http://www.grasshopper3d.com/photo/3d-venation-growth

Do you know how could I do this?

Permalink Reply by Richard Schaffranek on January 31, 2013 at 2:55

Like This?

But keep in mind "Diffusion Limited Aggregation" is something different than a minimal spanning tree even if the looks reassemble....

Attachments:

• MinimalSpanningTreeOnSphere.gh, 4 KB

Permalink Reply by Mariana Schetini Basso on January 31, 2013 at 13:11

Richard, you replied a very enlightening issue, I think many people have some mistakes about this (including me). Thank you so much, it'll be very useful !!