This is a small demo from my generative design class of the digi-pro project. It uses the euklidean algorithm to compute the greatest common divisor (GCD, GGT in german ) of two numbers. The mouse position (x, y) is used for the numbers. Press the keys 1, 2 or 3 to get different visualization methods of the results (you may need to click in the sketch once). The result is only shown if the GCD is greater than 3.
[iframe http://download.j-raedler.de/Processing/Euklid/Euklid.html 100% 500px]