![city travler](invaderPRN.gif) |
|
![invader fractal](ttlInvaderFractal.gif)
flash mx october, 2003 j.tarbell |
![prints available](../../../catalog/images/printsavailable.gif) |
|
![](../../images/pxgrey.gif) |
|
|
![launch huge Macromedia Flash](../../images/swfHuge.off.gif) |
|
|
|
|
800 x 800 pixels
5,000 invaders
approximately 45,000 movieclips |
|
|
![](../../images/pxgrey.gif) |
|
|
Invaders are friendly expressions of numerical magnitude.
Using only 15 bits, a mirror, and a little patience, we can render
32,768 unique instances of them.
Arrangement of invaders is based on a recursive fractal method. Given
a region, an invader is placed within a random percentage of it. The
process is then repeated for the remaining spaces until the regions
become indistinguishably small. |
|
|
|
|
|
|
![computational artifact, about 30% of all possible invaders](invader0000.gif)
0000 Approximately
30% of all possible invaders |
|
|
The invader's time amongst humans is going well
so far. |
|
|
![prints available](../../../catalog/images/printsavailable.gif) |
|
|