algorithmic modeling for Rhino
SpiderWeb is a .NET library providing functionality for preforming calculations on graphs. The library is created with a special focuse on the integration of graphs and graph related theroies (e.g. SpaceSyntax) in parametric design envoirnments. Therefore special Versions are avalible for:
Grasshopper
DesignScript (planned)
Any feedback, questions or critic is welcomed.
General introduction into graph theory
Documentation and samples
.NET documentation for SpiderWebLibrary.dll and GH_SpiderWebLibrary.dll
Website: http://www.gbl.tuwien.ac.at/Archiv/digital.html?name=SpiderWeb
Location: Vienna
Members: 256
Latest Activity: Sep 28, 2020
Hi!I would like to know if there is a way to measure in Spider Web the…Continue
Started by Md01. Last reply by Richard Schaffranek Dec 7, 2018.
can someone show me the definition and i cant find any example of spiderweb,can someone…Continue
Started by wiku. Last reply by Ukendt Kunstner Nov 3, 2018.
Hi!I've been trying to come up with a definition that will allow me to make one continous polyline of mesh edges to allow me to print it with a 3d extruder on a robotic arm.I haven't used spiderweb…Continue
Started by Louise Wotton. Last reply by Louise Wotton Dec 7, 2017.
Hi ! i am very interesting in combine space syntax with grasshopper , and i have seen the 3.2 version spider had "shortest path angular" "shortest path"component to calculate the segment angular…Continue
Started by veaturn. Last reply by Richard Schaffranek May 17, 2017.
Add a Comment
I have a simple grid of cells using a rectangular grid component. When I remove some of the cells before feeding them into the Graph From Cells component, the distances contain mistakes. I'm sure it is a simple issue somewhere. But I can't figure it out.
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.
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
can you explain more about how your plug-in was used to derive a drainage pattern?
cheers
© 2021 Created by Scott Davidson. Powered by
You need to be a member of SpiderWeb to add comments!