while coding my first program (game of life in colors) in 2005, i played on video memory directlly to process the pixel sum.

it is horribly slow.


soon, i played with cpu ram only, and a triple buffering.
it is very fast now.


there, i post 3 versions.


it is to show the difference beetwen direct to screen and triple buffering speed


enjoy

I like your psychedelic vision of life

it is crazy to seee how a single and simple algorythm can create variious effects.

the pixel sum is a convolution algorythm with a matrix like this one:


replacing the sum by a proportional calculation will create a very complex effect capability.

for example, imagine a convolution matrix like this:



in this case, pixels are additioned after a multiplication by it's weight in the matrix.

etc, etc.

the same thing is possible with 1D and 3D of course.

with 1D, it will act on a signal, for example, a sound.



the 0.5 value will take the half of the current sample, and 0.25 values will take the quart of neibourg samples.

adding them will act as a low-pass filter on the signal, something like a convolution or a FIR or IIR.

better explanatioàns can be found on sites related to DSP.

enjoy algo!