Iterative Branching I

After experimenting with L-systems, the present study focuses on RhinoScript. Using the methodology of L-systems’ computation, I have developed scripts that build systems of branch bifurcation. This time, it addresses the problem of (non-recursive) iteration.

The iteration is done through an incremental loop prior input of system parameters: quantity of iterations, deviation factor and thickness factor for the branch. Each iteration defines a starting point and two endpoints to build a pair of cylindrical branches.

As the system grows, it will change the thickness of the branch and the opening of the bifurcation. This opening can increase or decrease depending on the function applied to the displacement of the endpoint, defining the deviation.

To make calculations short, for now the system is two-dimensional; meaning that deviation of branches only happens in x, and growth in z.

In the case studies, we can see different combinations of functions for deviation and growth: increasing, decreasing and fixed.

In script execution, the construction of the system is not automatic; it prompts the user to select the branch to bifurcate, so the user can decide the structure to build.

The last image shows a comparison of different structures built with the same system, using the same parameters.
by Ernesto Bueno





  • Emilio Bueno Mar 2, 2008, 3:11

    Que bueno que estes incursionando en todos esos temas novedosos y los publiques

  • G.D.E.S. Mar 2, 2008, 14:37

    is a simple example of the many applications offered by the iterative branching system developed so
    Tree-like Pergola [+]

Leave a Reply