SpiderWeb

Add a Comment

Comment by Richard Schaffranek on February 26, 2013 at 17:59

Graph Introduction

Some basic information about graphs and other related topics can be found here. Just type in "graph" into the search field.

Comment by Nick Tyrer on February 13, 2013 at 5:25

Thanks for the answers man, greatly appreciate the help. I've already started implementing spiderweb into our current stadium project. Supposedly you learn something new everyday, yesterday i think i filled my quota for a month!

Comment by Richard Schaffranek on February 13, 2013 at 4:23

You are right, the file doesn't apply the separation between up and down, that was a newer file I was working on ...

WoodworkingJoint3D%20-%20NT.gh

Comment by Nick Tyrer on February 13, 2013 at 3:38

I was having a look through the script in finer detail yesterday, I'm getting the hang of the graph idea, its a really interesting script. I've attached the file i was working through, i just have a few questions, if you have a few minutes spare. (i put them in the definition)

I'm still struggling with the up/down classes. The classes get split 'randomly?' into three classes, (with no intersections within each class). Then those classes determine the orientation of joint. But in the final results, every class has joints on all sides, top/bottom/left/right. The joints all work, but there isn't any classes as you define that i can see.

https://www.wetransfer.com/downloads/55bdeb07b68b65e7f4a8dc050e5271...

Comment by Richard Schaffranek on February 12, 2013 at 8:40

Yes that's true, but the graph coloring also determines what side (up, down) the boolean operation is preformed on.

Comment by Nick Tyrer on February 12, 2013 at 8:06

That sounds helpful Richard, i will look out for it!

Do you mean those classes of intersections are possible, or are that it is the logic in the current script? At the moment it looks like the colours are determined by the random sequential graph component.

On a different note, it would be interesting to optimise the extrusion orientation of each member to maximise 'perpendicularity' of each join.

Comment by Richard Schaffranek on February 11, 2013 at 13:33

Hi Nick,

Good to hear that people get interested by the files I added.

The woodworking joints is a sample that should demonstrate that the graph tool can be used for other things than just shortest path,...

Yes the graph helps to maintain the relationships. This has two virtues: 

1. Faster/simpler boolean operation since it is only preformed on those of interest.

2. It also allows to define kind of different classes (colours) of beams:

1: intersection only up,

2: intersections only down,

others: intersections up and down 

At one point I will add a few more notes to the definition. At the moment I am working on a basic scriptum which will give some introduction to graphs. As soon as it is finished I will add a link.

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!

• ‹ Previous
• 1
• 2
• 3
• Next ›
• Page