Optimal Accumulations with Tetrahedrons

As part of a workshop I am helping to run I have encountered my first successes with employing evolutionary solvers as a design tool. The intention was to create a script that could produce aggregations of tetrahedron geometries by using a simple fractal system (begin with one tetrahedron, add another to each of its four sides, check for intersections and repeat), and thus by changing the geometries of the input tetrahedrons one could quickly evaluate the design potential of the accumulation. However, minute changes in input geometries produce quite complex changes in their fractal equivalents, and given that I was trying to achieve particular design goals (smallest unit for largest stack without intersections, largest stack for 3 generations, smallest possible gaps between tetrahedrons given a particular shape etc), it seemed useful to employ Galapagos. The results are below.

Rule: number of tetrahedrons * max dist between. (begins to approximate equilateral)

~ by ledatomica on February 4, 2011.

3 Responses to “Optimal Accumulations with Tetrahedrons”

  1. very cool – what are you doing to perform the fractal development? scripting or some other strategy?

  2. Yeah all the geometry is handled with a vb script component – getting and matching faces, checking for intersections and adding new faces to a tree.

  3. hi! i was wondering if there is any chance at all you could post the script. i’m trying to work on the same form of module conglomeration
    ?

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

 
%d bloggers like this: