Finally, I got to polish (well, sort-of) and present the algorithm that self-normalizes the optimum paths between a network of graphs – I’ve used this technique for my previous project, the CETg Upgrade. Scroll down for the download link.
Here’s a video of an early version:
Another (more recent but shittier quality) video:
As well, there seems to be a lot of interest around this technique recently, as Daniel Piker said so recently in his post. I now officially pledge my support towards the wooly-threads/wetgrid/whatever hype! May we live long and prosper.
This approach can improve substantially current urban parametric approaches as a way of generating basic circulation routes (road layout) as it basically “normalizes” or joins/removes connections that are close together and can be merged – thus reducing the overall routes gaining coherence and readability without sacrificing too much in terms of circulation.
It works in 3d as well. Here are some screens:
Here’s the grasshopper definition file (0.7.+ only): download it! (right-clikc, save as).
An old image from the CETg project, where you can see the differences between the initial, mathematically-optimum (?) and the self-normalized graph.
Much more sexy and, you know, organic!, isn’t’ it? But what the best part is, one that i retro-actively found while researching on CETg, is that there seems to be some sort of real-life truth to all the babble above. Here’s an image of Bucharest’s old street network. There are some striking similarities between the output of the above algorithm and the network below.