Algorithm Stickers

/** Rupert Russell processing.org */ int count = 0; int click; int oldCount = 0; void setup() { size(13500 , 13500 ); stroke(0); strokeWeight(0.1); // noLoop(); colorMode(RGB, 255); background(255); } void draw() { colorMode(HSB, 360, 100, 100); translate(width / 2, height / 2); count ++; rotate(count * 00.1); fill(count / 50, 100, 100); // Change colour as you sporal out scale(0.01 * count); // Increase size as you spiral out triangle(30, 75, 58, 20, 86, 75); // println(0.005 * count); if (0.005 * count > 100){ save("Play3_" + count + ".png"); exit(); } if (count == oldCount + 100){ save("Play4_" + count + ".png"); ...

// based on Semi Circle Patchwork by Manoylov AC // https://www.openprocessing.org/user/23616/ Code on Code on "Github":https://github.com/rupertrussell/pattern_003

*I have updated the artwork for the Photographic Print to add 20% white space around the image sorry for any inconvenience caused* // How to calculate points on a circle // Based on code from http://www.mathopenref.com/coordcirclealgorithm.html /* There are 2 * PI Radians in a circle If we have a circle of radius 20 with its center at the origin, the circle can be described by the pair of equations x = 20 cos(t) y = 20 sin(t) also pased on https://www.youtube.com/watch?v=qhbuKbxJsk8&feature=youtu.be Times Tables, Mandelbrot and the Heart of Mathematics by Burkard Polster and Giuseppe Geracitano see: http://codepen.io/hippiefuturist/full/NAvqgk/ */ int w = 3502 ; // width of image int h = 3502; ...

/* VARIATIONS: Draw lines between all circles Draw lines between new circle and closest neighboor Move new circle to exactly touch closest neighboor Change fill or stroke depending on circle size Change overlap threshold (slight overlap ok / large margin) https://gist.github.com/brysonian/235705 */ Circle[] circles = new Circle[10000]; int count = 0; int maxDiameter = 200; int minDiameter = 4; int lastAdded = 0; int lastAddedTimeout = 100; int click; void setup() { size(1500, 1500); smooth(); background(255); noFill(); } void draw() { //background(255); if (count < circles.length) { circles[count] = new Circle(5, maxDiameter); for (int i=0; i<count; i++) ...

/** * Based on :rainbow spin * @author aa_debdeb * @date 2016/07/07 "rainbow spin" by aa_debdeb http://www.openprocessing.org/sketch/376325 Licensed under Creative Commons Attribution ShareAlike https://creativecommons.org/licenses/by-sa/3.0 https://creativecommons.org/licenses/GPL/2.0/ */ float R = 13500 / 1.3; void setup(){ size(13500, 13500); stroke(0); strokeWeight(1); noLoop(); } void draw(){ colorMode(RGB, 255); background(255); colorMode(HSB, 360, 100, 100); translate(width / 2, height / 2); rotate(frameCount * 0.03); float angleStep = 24; for(float rot = -0.5 ; rot < 1; rot += 0.01){ println("rot = " + rot); for(float angle = 0; angle < 360; angle ...

Created with "Processing":http://processing.org/ // Post Production in Photoshop // Spiral v7 // Author Rupert Russell // October 11, 2010 void setup() { background(0, 0, 0); // Black size(2400, 2024); noFill(); smooth(); } // Global Variables float x = 0; float y = 0; float deg = 1; float st = 1; int count = 0; void draw() { strokeWeight(st); translate(width/2, height/2); // translate to center of screen rotate(deg); stroke(255, 255, 255); // White point(x, y); y = y + 0.1; deg = deg + 0.5; st = st + 0.003; count ++; if (count > 9500) {noLoop(); } } // Save tif when mouse is clicked void mouseClicked(){ noLoop(); save("spiral2400.tif"); }

// R.A. Robertson 2012.03 "Circle Packing 3" ~ www.rariora.org ~ /* "Circle Packing" by R.A. Robertson http://www.openprocessing.org/sketch/57325 Licensed under Creative Commons Attribution ShareAlike https://creativecommons.org/licenses/by-sa/3.0 https://creativecommons.org/licenses/GPL/2.0/ */ float x, y, r, minR, maxR, radii, distance; // Location, radius parameters, and distance. Circle[] circleList = new Circle[1]; boolean toggleLoop = true; color ground = #FFFFFF; // Background color. color colorTest; // Checks if XY are inside or outside of Circles, using background color. boolean colorOK; // Sets boolean from colorTest. int maxCircles = 5000; // Limit number of Circles. Too high, and pro...

/** Rupert Russell processing.org */ int count = 0; int click; void setup() { size(13500 , 13500 ); stroke(0); strokeWeight(0.1); // noLoop(); colorMode(RGB, 255); background(255); } void draw() { colorMode(HSB, 360, 100, 100); translate(width / 2, height / 2); count ++; rotate(count * 00.1); fill(count / 10, 100, 100); scale(0.005 * count); triangle(30, 75, 58, 20, 86, 75); // println(0.005 * count); if (0.005 * count > 100){ save("Play3_" + count + ".png"); exit(); } } void keyTyped() { println("typed " + int(key) + " " + keyCode); if (int(key) == 115) { // s for save save("paly003-" + click + ".png"); print...

More digital art!

Author Rupert Russell date: 5 December 2017 Created with Processing see processing.org thanks to https://www.redbubble.com/people/podartist/works/14638372-alice-blue-quatrefoil-in-an-english-country-garden for inspiration Code on GitHub at: https://github.com/rupertrussell/pattern009

/** * rainbow spin * * @author aa_debdeb * @date 2016/07/07 */ float R = 220; float angleStep = 24; void setup(){ size(500, 500); stroke(0); strokeWeight(3); } void draw(){ colorMode(RGB, 255); background(255); colorMode(HSB, 360, 100, 100); translate(width / 2, height / 2); rotate(frameCount * 0.03); float rot = map(mouseX, 0, width, -3.0, 3.0); for(float angle = 0; angle < 360; angle += angleStep){ fill(angle, 100, 100); beginShape(); for(float r = 0; r < R; r += 1){ float x = r * cos(radians(angle + r * rot)); float y = r * sin(radians(angle + r * rot)); vertex(x, y); } for(float a = angle; a < angle + angleStep; a += 1){ float x = R * ...

Created with Mathematica graph =PolyhedronData["Dodecahedron","NetImage"] Export["DodecahedronNet.svg", graph]

A brighter version of post production in Photoshop // R.A. Robertson 2012.03 "Circle Packing 3" ~ www.rariora.org ~ /* "Circle Packing" by R.A. Robertson http://www.openprocessing.org/sketch/57325 Licensed under Creative Commons Attribution ShareAlike https://creativecommons.org/licenses/by-sa/3.0 https://creativecommons.org/licenses/GPL/2.0/ */ float x, y, r, minR, maxR, radii, distance; // Location, radius parameters, and distance. Circle[] circleList = new Circle[1]; boolean toggleLoop = true; color ground = #FFFFFF; // Background color. color colorTest; // Checks if XY are inside or outside of Circles, using background color. boolean colorOK; // Sets boolean from colorTest. int maxCircles ...

//"Random Square Animation" by Black //http://www.openprocessing.org/sketch/225008 //Licensed under Creative Commons Attribution ShareAlike //https://creativecommons.org/licenses/by-sa/3.0 //https://creativecommons.org/licenses/GPL/2.0/ int oldFrameCount = 0; void setup() { size(300, 300); } int w =250, N=13, r=5; float t=0, k=0; void draw() { background(#FF0533); float dw = 250/N; translate(width/2, height/2); noStroke(); rectMode(CENTER); for (int i=0; i<N; i++) { rotate(radians(t*(N-i))); if (i%2==0)fill(-1); else fill(#FF0533); rect(0, 0, w-i*dw, w-i*dw, r*(N-i), r*(N-i), r*(N-i), r*(N-i) ); } t = sin(radians(k)); k++; println(" frameCount " + frameCount); if ...

// draws a Polar Flower // Based on code from http://www.physics.emory.edu/~weeks/ideas/rose.html // Created with "Processing":http://processing.org/ int screenWidth = 13500; int screenHeight = 13500; void setup() { size(13500, 13500); background(0); // black background stroke(255,255,255); strokeWeight(5); smooth(); // antialias lines } float rad; float theta; float x; float y; float r; void draw() { for (rad = 1; rad < 700; rad ++) { for (theta = 0; theta <= 10 * PI; theta += 0.01) { r = rad * (8 + sin(theta * 10 + rad / 80)); // "rad/20" gives the figure a slight phase shift as it grows larger x = r * cos(theta) + screenWidth / 2; y = r * si...

// draws a Polar Flower // Based on code from http://www.physics.emory.edu/~weeks/ideas/rose.html // Created with "Processing":http://processing.org/ int screenWidth = 13500; int screenHeight = 13500; void setup() { size(13500, 13500); background(0); // black background stroke(255,255,255); smooth(); // antialias lines } float rad; float theta; float x; float y; float r; void draw() { for (rad = 1; rad < 700; rad ++) { for (theta = 0; theta <= 10 * PI; theta += 0.001) { strokeWeight(abs(sin(theta))); r = rad * (8 + sin(theta * 10 + rad / 80)); // "rad/80" gives the figure a slight phase shift as it grows larger x = r * cos(theta) + screenWidth / 2; ...

// Code by Rupert Russell // you are welcome to use this code as you see fit. // Chances are it has bugs // December 30 2017 // 7632 x 6480 int displacment = 150; int count = 0; int loop = 0; int x = 0; float startEllipseSize = 200; float ellipseStep = 20; boolean black = true; float xCord = 0; float yCord = 0; int counter = 0; void setup() { size(9000, 9000); background(255); fill(0); noStroke(); smooth(); noLoop(); } void draw() { println("drawing grid version please wait"); grid(); println("Saving the grid please wait"); save("grid.png"); println("Should Exit now"); exit(); /* println("drawing sticker version please wait"); sticker(); save(...

// draws a Polar Flower 006 // Based on code from http://www.physics.emory.edu/~weeks/ideas/rose.html // Created with "Processing":http://processing.org/ int screenWidth = 13500; int screenHeight = 13500; float sWeight = 1; float xSize = 1; float ySize = 1; void setup() { size(13500, 13500); background(0); // black background stroke(255,255,255); smooth(); // antialias lines } float rad; float theta; float x; float y; float r; void draw() { for (rad = 5;rad<600;rad+=4) { for (theta=0;theta<=2.0*3.14159265;theta+=0.007) { sWeight = sWeight + 0.001; ; strokeWeight(sWeight); r = rad*8 + (16*sin(theta*6+rad*PI/4)); x = r * cos(theta) + scr...

*I have increased the canvas size for the photographic print by 20% so the image now has a white border sorry for the inconvenience caused* Please send me an email if you have questions Rupert // How to calculate points on a circle // Based on code from http://www.mathopenref.com/coordcirclealgorithm.html /* There are 2 * PI Radians in a circle If we have a circle of radius 20 with its center at the origin, the circle can be described by the pair of equations x = 20 cos(t) y = 20 sin(t) also pased on https://www.youtube.com/watch?v=qhbuKbxJsk8&feature=youtu.be Times Tables, Mandelbrot and the Heart of Mathematics by Burkard Polster and Giuseppe Geracitano */ int w = 3502 ; // width of image int...

Created with "Processing":http://processing.org/ // based on example 22-11 // Reas, C., & Fry, B. (2007). Processing: A Programming Handbook for Visual Designers and Artists. Cambridge: The MIT Press // Adapped by Rupert Russell // _17_11_2010_001 int x = 0; int y = 0; int r = 120; // starting radius int n = 5; // number of recursions int rs = 16; // Random Seed int gap = 230; // spacing between each cell void setup(){ size(2400,3200); noStroke(); smooth(); noLoop(); randomSeed(rs); } void draw(){ for (int count_x = 1; count_x <=10 ; count_x +=1) { for (int count_y = 1; count_y <=10; count_y +=1){ drawCircle(x + gap * count_x, y + gap * count_y, r, n); } } } ...

Created with "processing":https://processing.org/ and the "wordcram":http://wordcram.org/installing-wordcram/ library see also: "Making a wordcram video":http://peterneumark.com/2012/02/making-a-wordcram-video/ source code below: import wordcram.*; import java.awt.*; void setup() { size(4000, 4000); background(255); PImage image = loadImage("yinyang4.png"); image.resize(width, height); Shape imageShape = new ImageShaper().shape(image, #000000); ShapeBasedPlacer placer = new ShapeBasedPlacer(imageShape); new WordCram(this). fromWords(repeatWord("synchronous", 1000)). withPlacer(placer). withNudger(placer). sizedByWeight(1, 400). angledAt(0). withColor(#F5B502). ...

Abstract, algorithm, circle, modern, intricate

Processing Code on "Github":https://github.com/rupertrussell/radians-vs-degrees

Awesome witty stuffs for Python Programmer.

// Fork of https://www.openprocessing.org/sketch/138954 // Circle Tree by Agoston Nagy // Code on Github at: https://github.com/rupertrussell/Circle-Tree-002

// Fork of https://www.openprocessing.org/sketch/138954 // Circle Tree by Agoston Nagy // Code on Github at: https://github.com/rupertrussell/Circle-Tree-009

// Created with Processing see processing.org // Thanks to Daniel Shiffman // http://codingtra.in // http://patreon.com/codingtrain // Visualizing the Digits of Pi // https://youtu.be/WEd_UIKG-uc String pi; int[] digits; int[] counts = new int[10]; int index = 0; void setup() { size(830, 830); pi = loadStrings("pi-1million.txt")[0]; noLoop(); println(pi.length()); String[] sdigits = pi.split(""); //println(sdigits.length); digits = int(sdigits); //printArray(digits); background(0); stroke(255); noFill(); translate(width/2, height/2); // ellipse(0,0,400,400); } void draw() { translate(width/2, height/2); thing(); rotate(radians(90)); thing(); rotate(radians...

Giving up your data freely makes you a product, but are you getting fairly paid for your attention?

/* Author Rupert Russell date: 5 December 2017 Created with Processing see processing.org thanks to https://www.redbubble.com/people/podartist/works/14638372-alice-blue-quatrefoil-in-an-english-country-garden for inspiration */ int scale = 50; int baseCircleSize = 10; int weight = 10; void setup() { blendMode(DIFFERENCE); size(4000, 4000); background(255); } void draw() { noLoop(); fill(255); stroke(0); // white circles 1 for (int y = (baseCircleSize * scale) /2; y < height; y = y + baseCircleSize * scale) { for (int x = (baseCircleSize * scale) /2; x < width; x = x + baseCircleSize * scale) { ellipse(x, y, baseCircleSize * scale, baseCircleSize * scale); } } ...

See the Black Background version for details !http://ih0.redbubble.net/image.288260247.4644/gbrf,6x6,f,245x245-pad,220x200,ffffff.u1.jpg!:http://www.redbubble.com/people/rupertrussell/works/24064644-i-ching-004-work-in-progress

F*ck the algorithm and this govt

float r = 0; void setup() { size(13500 ,13500); background(10); smooth(); noStroke(); } void draw() { fill(255); rotate(r); float circle_size = random(5 + r / 90, 15 + r / 60); ellipse(80 + r, 10, circle_size, circle_size); r = r + 0.2; println(r + 80); if (80 + r > 14500){ save("rotations3.png"); exit(); } }

Created with Procesing: import wordcram.*; import java.awt.*; void setup() { size(4000, 4000); background(255); PImage image = loadImage("yinyang4.png"); image.resize(width, height); Shape imageShape = new ImageShaper().shape(image, #000000); ShapeBasedPlacer placer = new ShapeBasedPlacer(imageShape); new WordCram(this). fromWords(repeatWord("synchronous", 1000)). withPlacer(placer). withNudger(placer). sizedByWeight(1, 400). angledAt(0). withColor(#F5B502). drawAll(); imageShape = new ImageShaper().shape(image, #ffffff); placer = new ShapeBasedPlacer(imageShape); new WordCram(this). fromWords(repeatWord("Poly", 1000)). withPlacer(pl...

🤖

I mean, have you been on TikTok? That algorithm is changing the world, one personal discovery at a time. Sometimes the things I learn about myself surprise me. Honestly, the accuracy of the algorithm makes me laugh most when I hear politicians or the like screaming about, “all I get are half naked pre-teens” Well, Bob or Karen, that says a lot more about you than it does the clock app.

// Fork of https://www.openprocessing.org/sketch/138954 // Circle Tree by Agoston Nagy // Code on Github at: https://github.com/rupertrussell/Circle-Tree-002