Introduction & Basics
Parametric Urban Design
Parametric Urban Analysis
0% Complete
0/76 Steps

Parametric Street Networks II – Recursive Street Network

In this lesson, we will learn how to build simple recursive functions. A recursive function is a test that can loop the output and import it again as an input for the same function. But this test has to have a very clear condition so the loop stops after all inputs have achieved that condition. The simplest example is a tree; where each branch holds a collection of branches that have the same rules that created them. More interesting examples here (Daniel Shiffman – Nature of Code -8.2 Recursion )

Base file – Weiamr street network

Help file – Plot Cleaner

Example file 01 – Street network from guideline

Example file 02 – Street network from grid

For questions and comments please use the course forum. The link is on the course navigation on the left!

How useful was this lesson? - Click on a star to rate it!

Average rating / 5. Vote count:

It seems that the lesson is still in need of improvement!

Let us improve this lesson!