Algorithms

• 

  SAND.TRAVELER

  The Sand Traveler is a rendering of 1,000 traveling particles, each in pursuit of another. Over time, patterns of travel are exposed as sweeping paths of color.

• 

  HENON.PHASE.DEEP

  a Henon Phase expansionbased on code by Paul Bourke In hopes and fears of something unknown, we travel deep into the Henon strange attractor (see Henon Phase).All of the images on this page were created by exposing the traveling patterns of particles over long periods of time. The particles are trapped in the simple, but elegant strange attactor as defined by the following transformations: xn+1 = xn cos(a) – (yn – xn2) sin(a)yn+1 = xn sin(a) + (yn – xn2) cos(a)

• 

  HENON.PHASE

  In computing time scales, the Henon Phase is an ancient strange attractor. A point is moved through two dimensional space based on the following transformational equations: xn+1 = xn cos(a) – (yn – xn2) sin(a)yn+1 = xn sin(a) + (yn – xn2) cos(a) These images plot the phase space of the Henon system at arbitrary values of a.

• 

  BIT.10001

  Exposing the paths of particles as they accelerate around an infinite numerical attractor, we see a process of flow ranging from gentle to chaotic. It is an amazing thing to render 10,001 particles, in three dimensions, in real time.

• 

  CUBIC.ATTRACTOR

  A minimalist modification of the City Traveler system. Cities are initiated in grid locations.

• 

  BUDDHA.BROT

  The Buddhabrot Set is a re-visualization of the familiar Mandelbrot Set using a technique invented by Melinda Green. Instead of selecting points on the real-complex plane, initial points are selected at random from the image region.