DATA-DADA is a software based interconected packing algorithm, which reads different color map arrays, either by random, noise and/or manual values.
it consists of:
– predefined color tables.
– randomly mixed scales of predefined color tables
– random color picks out of algorithmically manipulated color arrays.

30 keyboard keys were linked to the color tables, which are assambled and collected together over the years out of all kind of material.
4 keyboard keys are for controlling size manipulation, transparent shutter and the recording control. a packing algorithm is used to paint the circles.

all circle units are interconnected, sending theyr own color beam and receiving the one of the other interconnected circle.
when i play this organ, i start throwing the dice for a list of input values combined with a choosen color map and later react
to the constellations by going over and over it again.
at a certain point, i finish a recording as a vector image for possible large print.

to put colored circles on a white sheet, implies – to me – a very fundamental expression of the beauty and pleasure of painting.

the circle itself represents the most perfect form and at the same time all contradictions seem to be embedded within it.
that pi, the key connection between radius and circumference, is (probabely) infinite and (probabely) without a certain pattern
or systematic and that sience could not solve that riddle until today, is really fantastic and says it all.

 (made with processing)













pigment on canvas
200x300cm ( 3 parts)


c-flower is based on a bezier vector curve forming a flower like shape by by rotating it and deforming it by random and/or noise values.
the coloring is made with read out of predefined color map arrays and layering.





curve drawer 1



schorfheide, 2010


the  curve drawer series is based on a vector curve function which reads out a color map or map array and draws in differently occillation structures over the stage, controlled by different mouse action.








swirl series, 2009
based on a rotating bezier curve and color map read out.





de jong


de jong series, 2008

these works are based on the simple Peter de Jong map equations:
x’ = sin(a * y) – cos(b * x)
y’ = sin(c * x) – cos(d * y)

For most values of a,b,c and d the point (x,y) moves chaotically. The resulting image is a map of the probability that the point lies within the area represented by each pixel. As you let it render longer it collects more samples and this probability map and the image becomes more accurate.
Details »

barnsley penrose

Details »


spectr|a|um audio visual lounge
29. september 2007, Dexia Tower Brussels
LAB[au] and Dexia Tower invite:
Holger Lippmann (photos),  Limitatzero,  Olaf Bander