SpiderWeb

Add a Comment

Comment by Nick Tyrer on February 11, 2013 at 12:34

Hey Richard, 

I've just downloaded spiderweb, i must admit it was for the Duplicate line tool. But looking through the example files this looks really impressive and i'm gonna have to do some research.

In particular the woodworking joint has caught my eye. Could you perhaps give me a little information of this model? What the logic is. I cant quite follow the graph related parts of the script. Does the graph maintain the relationship to each beams members to simplify Boolean operations? What does the color coding represent?

Thanks in advance man

Comment by Danny Boyes on September 20, 2012 at 3:05

Rutten's 3rd Law of Grasshopper

"Never release something with ugly icons."

 

It's a big complement :)

Comment by Richard Schaffranek on September 20, 2012 at 2:53

More than a new Icon!

Comment by Danny Boyes on September 20, 2012 at 2:28

Nice new Icon!

Comment by Pieter H. on August 31, 2012 at 7:56

Ok, thanks.

I will post something when I'm done, still working out some issues and details.

Comment by Richard Schaffranek on August 31, 2012 at 7:50

Hmm sounds fun, could you post something in the gallery?

I create Spideweb with the idea to be able to use measurements proposed i.e. by SpaceSyntax as a generative input,... 

So the problem if you don't just analyse geometry but create geometry you have to make some simplifications.
Possibilities of movement on surface can be representation through a orthogonal grid of lines. This abstraction doesn't take into account that you could walk diagonal. So the filters are used in order to even the values.

See:

http://www.gbl.tuwien.ac.at/Archiv/digital.html 

-> longest average path

Comment by Pieter H. on August 31, 2012 at 5:46

Ok, thanks! Could you give an example of what you use it for?

BTW, kudos for spiderweb! I'm using it for justified plan graph analysis (with the aim of creating an adaptability assessment tool for buildings).

Comment by Richard Schaffranek on August 31, 2012 at 4:44

It simply takes the Values of the Neighbours of a Vertex and the Value of the Vertex itself and the calculates the median Value or the average Value depending which one you pick.

So lets assume we have a Vertex [V] connected to four other Vertexs [N1-N4].

Each of the has a Value: 

V ... 1

N1 ... 5

N2 ... 3

N3 ... 8

N4 ... 11

The Average Filter would set the Value of [V] to

(1+5+3+8+11)/5 = 5,6

The Median Filter would Sort Values and pick the middle one

1,3, [5], 8, 11

Hope that helped...

Comment by Pieter H. on August 31, 2012 at 4:35

What does the neighbourhood filter component do? It isn't mentioned in the overview of the components.

Comment by Richard Schaffranek on July 22, 2012 at 8:02

The diagonals are due to the rounding erros in Rhino. But if you download the newest releas this is taken care of. For the other problem there seams to be some strange error in the code, which I will fix after my hollydays, sorry!

• ‹ Previous
• 1
• …
• 6
• 7
• 8
• 9
• Next ›
• Page