SpiderWeb

Information

SpiderWeb is a plugin providing simple graph tools in Grasshopper.

Website: http://www.gbl.tuwien.ac.at/Archiv/digital.html
Location: Vienna
Members: 32
Latest Activity: Apr 30

SpiderWeb 2.4

GraphFromCells

Removes all double lines and invalid lines from a list of lines.
New in Version 2.0!

GraphFromCells

Creates a graph from a set of ajoining cells. It outputs the graph as a dataTree, the vertex points of the given graph, the graph edges as lines and the distances between the vertex points of the Graph.

New in Version 2.0!

Outputs a Synchron List of Vertexes an Cells! Version 2.4

GraphFromLines

Creates a graph from a set of lines. It outputs the graph as a dataTree, the vertex points of the given graph and the distances between the vertex points of the Graph.

GraphFromPoints

Creates a graph from a set of points and a given distance. It outputs the graph as a dataTree, the vertex points of the given graph and the distances between the vertex points of the Graph.

ShortestPath

Callculates the shortest path (distance) from a starting point to all other points. If there are multible solutions (i.e. a regular grid) all possible paths are callculated. Renamed in Version 2.0!

ShortestPathAngular

This callculation is similar to "Dijkstra" only the shortest path is not defined through the distance but through the turning angle between two lines. If there are multible solutions (i.e. a regular grid) all possible paths are callculated. To find out more please read: From axial to road centre lines; Alsdair Turner;

Renamed in Version 2.0!
Bugfixes in Version 2.4!

EulerianPath

Checks if the given graph has an eulerian path. If so it will output all possible starting points, if not there is no output.

MinimalSpanningTree

Callculates the minimal spanning tree using Kruskal's algorithm.

Input, Output Paramters Changed in Version 2.1!

MaximalSpanningTree

Callculates the maximal spanning tree using Kruskal's algorithm.

Input, Output Paramters Changed in Version 2.1!

ChoiceBetweenPoints

Callculates how often a line segment is part of the shortest path between each pair of given starting points. The parameter MD defines the maximal detour.

Breath-first Search

Preforms a Breath-first Search on the given graph. Can be used to callculate the 'Integration' as described in:

Hillier, Bill; Hanson, Julienne; The Social logic of Space; Cambridge University Press;1984; Cambridge, New York; p. 108;

New in Version 2.3!

randomized Sequential Graph Coloring

Randomly colors the given Graph trying to minimize the used colors. Will stop after n itterations or if the achived coloring is equal or less then the aimed coloring.
New in Version 2.3!

Discussion Forum

SpiderWeb 2.4

New Version avalible!A major Bug fix at the ShortestPathAngular componentNew Outputs for the graph from cell component.Continue

Started by Richard Schaffranek Mar 30.

SpiderWeb 2.3 1 Reply

New Release out now.Added two functions:Breath-first Searchrandomized Graph ColoringContinue

Started by Richard Schaffranek. Last reply by Martin Dembski Feb 3.

SpiderWeb 2.0

A new Version of SpiderWeb with two new features and some changes is out.Also there are some new samples with the download file!Continue

Started by Richard Schaffranek Dec 27, 2011.

View All

Comment Wall

Add a Comment

You need to be a member of SpiderWeb to add comments!

Comment by Richard Schaffranek on January 26, 2012 at 14:24: There are more samples of how to use spiderWeb with the download.

You can apply it to freeform surfaces but as mentioned before overlaps are not taken into account. You would need to adapt the definition.

Graph as in Graph theory....

Basically a simple tree representation. For each vertex point there is a branch, each number in the branch reveres to a vertex point it shares an edge with.

Comment by Steve Lewis on January 26, 2012 at 14:17: Ok I'll check it out.

Two more questions.

What do u mean by a graph? I presume it's not just a 2d plot of values

Where would I use spider web?

Can u apply the drainage pattern definition to a fee form surface or must it be faceted?

Comment by Richard Schaffranek on January 26, 2012 at 14:00: If you download the latest version from the homepage, the script is included.

From a point grid on the surface you create a simple graph where every vertex point has eight neighbours. Then you choose, for every vertex point, the neighbour with the largest negative z - difference and delete the rest.

The minimum values are those vertex points without a neighbour.

Of course this is not so nice and for example it would need some adaptation to take overlaps into account.

RICHARD