Processing Pins and Buttons

// Daniel Shiffman // http://codingtra.in // http://patreon.com/codingtrain // Code for: https://youtu.be/KWoJgHFYWxY // Coding Challenge #30: Phyllotaxis // http://algorithmicbotany.org/papers/abop/abop-ch4.pdf float n = 100000; float c = 36; float start = 0; float hu ; void setup() { size(13500, 11462); // size(1350, 1350 ); colorMode(HSB, 360, 255, 255); background(0); stroke(0); strokeWeight(8); } // https://raw.githubusercontent.com/CodingTrain/Rainbow-Code/master/challenges/CC_30_Phyllotaxis/CC_30_Phyllotaxis.pde void draw() { noLoop(); translate(width / 2, height / 2); // rotate(n * 0.3); for (int i = 0; i < n; i++) { float a = i * radians(137.5); float r = c * sqrt(...

Noisy brainwork

// Daniel Shiffman // http://codingtra.in // http://patreon.com/codingtrain // Code for: https://youtu.be/KWoJgHFYWxY // Coding Challenge #30: Phyllotaxis float n = 100; float c = 30; float oldN; float start = 0; void setup() { size(13500, 13500 ); // size(1350, 1350 ); colorMode(HSB, 360, 255, 255); background(0); stroke(0); } // https://raw.githubusercontent.com/CodingTrain/Rainbow-Code/master/challenges/CC_30_Phyllotaxis/CC_30_Phyllotaxis.pde void draw() { translate(width / 2, height / 2); // rotate(n * 0.3); for (int i = 0; i < n; i++) { float a = i * radians(137.5); float r = c * sqrt(i); float x = r * cos(a); float y = r * sin(a); float hu = i+start;//sin(sta...

// Daniel Shiffman // http://codingtra.in // http://patreon.com/codingtrain // Code for: https://youtu.be/KWoJgHFYWxY // Coding Challenge #30: Phyllotaxis // http://algorithmicbotany.org/papers/abop/abop-ch4.pdf float n = 100000; float c = 34; float start = 0; float hu ; void setup() { size(13500, 11462); // size(1350, 1350 ); colorMode(HSB, 360, 255, 255); background(0); stroke(0); strokeWeight(2); } // https://raw.githubusercontent.com/CodingTrain/Rainbow-Code/master/challenges/CC_30_Phyllotaxis/CC_30_Phyllotaxis.pde void draw() { noLoop(); translate(width / 2, height / 2); // rotate(n * 0.3); for (int i = 0; i < n; i++) { float a = i * radians(137.5); float r = c * sqrt(...

code on Github at: https://github.com/rupertrussell/SpiralWaves001

code on Github at: https://github.com/rupertrussell/SpiralWaves001

code on Github at: https://github.com/rupertrussell/SpiralWaves001

code on Github at: https://github.com/rupertrussell/SpiralWaves001

// Fork of https://www.openprocessing.org/sketch/138954 // Circle Tree by Agoston Nagy int maxCells = 21000; float startradius = 700; // was 780 float minRadius = 2; int count = 0; float speed = 10000; int startTime, maxTime; ArrayList Cells = new ArrayList(); void setup() { size(9411, 9411); background(0); // frameRate(60); noStroke(); Cell C = new Cell(new PVector(width/2, height/2), null, startradius); } void metro(int maxTime) { int elapsed = millis() - startTime; if (elapsed>maxTime) { int over = elapsed-maxTime; startTime=millis()-over; for (int c=0; c<Cells.size(); c++) { Cell C = (Cell) Cells.get(c); if (Cells.size() < maxCells && C.radius > m...

Programmed in "Processing":https://processing.org/ "Packing":https://www.openprocessing.org/sketch/440352 by Tomáš Archalous https://www.openprocessing.org/sketch/440352

// Based on https://www.openprocessing.org/sketch/176444 // ArrayList<Circle> circles = new ArrayList<Circle>(); boolean centered; int num = 5500; int click = 0; int min = 5; // Min curcle size int max = 630; // max circle size /* Our object */ Circle c = new Circle(new PVector(random(width/2-num, width/2+num), random(height/2-num, height/2+num)), (int)random(min, max)); void setup() { size(13500, 13500); noStroke(); circles.add(c); } void draw() { background(0); for (int i = 0; i < circles.size(); i++) { Circle c = (Circle) circles.get(i); c.draw(); } PVector newLoc = new PVector(random(width/2-num, width/2+num), random(height/2-num, height/2+num)); int newD = (int) random(min,...

Created with "Processing":http://www.processing.org/

// Code by Rupert Russell 12 May 2018 // as allways this may contain bugs and is not as elegant as it could be // licence https://creativecommons.org/licenses/by-sa/4.0/ // Attribution-ShareAlike 4.0 International (CC BY-SA 4.0) // Please note that this code has become a little "clunky" with too many cludges int Y_AXIS = 1; int X_AXIS = 2; color b1, b2, c1, c2; float startX; float startY; float endX; float endY; float x; float y; float h = 150; float k = 150; float r = 40; boolean start = true; int count = 0; double step; float yGap = 161; // 160 // 2875 x 3900 T-Shirt // 3502 x 2385 Journal // 1765 x 2481 notebook // 2344 x 2467 poster // 2940 x 2940 clock // 5748 x 5748 scarves // 6310 x 6230 A-Li...

// based on https://www.openprocessing.org/sketch/453596 // cubes by beatriz t. int counter = 0; int scale = 4; void setup() { size (9411, 9411); background (0); } void draw () { // rotate (PI/6); for (int i = 30 * scale; i <= width; i += 60 * scale) { for (int j =30 * scale; j <= height; j +=60 * scale) { hexagono(i, j, 30 * scale); //base esquerda stroke(0); } } for (int i = 0; i <= width; i += 60 * scale) { for (int j =0; j <= height; j +=60 * scale) { hexagono (i, j, 20 * scale); } } } void hexagono (int posX, int posY, float lado) { for (float i= 0; i< 2* PI; i = i + PI/3) { pushMatrix(); fill (i * 42, mouseY, mouseX); fill (i * 42, 255...

// Daniel Shiffman // http://codingtra.in // http://patreon.com/codingtrain // Code for: https://youtu.be/KWoJgHFYWxY // Coding Challenge #30: Phyllotaxis // http://algorithmicbotany.org/papers/abop/abop-ch4.pdf float n = 100000; float c = 36; float start = 0; float hu ; float radius; int oldCount = 0; int count = 0; void setup() { size(13500, 11462); // size(1350, 1350 ); colorMode(HSB, 360, 255, 255); background(0); stroke(0); strokeWeight(8); println("Running"); } // https://raw.githubusercontent.com/CodingTrain/Rainbow-Code/master/challenges/CC_30_Phyllotaxis/CC_30_Phyllotaxis.pde void draw() { noLoop(); translate(width / 2, height / 2); for (int i = 0; i < n; i++) { float ...

The future is now?... or is it.. THE PAST!??!??!?? Design by: Joe Buchholz https://twitter.com/cobysoftco

neurodiversity!

code on Github at: https://github.com/rupertrussell/SpiralWaves001

// 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-002

Made using the online app Silk http://weavesilk.com

Made using the online app Silk http://weavesilk.com

"Stacked Hexagons 001" by Rupert Russell Licensed under Creative Commons Attribution ShareAlikehttps://creativecommons.org/licenses/by-sa/3.0https://creativecommons.org/licenses/GPL/2.0/ written in processing see https://processing.org/ Code on github at: https://github.com/rupertrussell/pattern010

Made using the online app Silk http://weavesilk.com

Made using the online app Silk http://weavesilk.com

"Helmholtz's angle expansion":http://www.psy.ritsumei.ac.jp/~akitaoka/cataloge.html The vertical appears to tilt counterclockwise while the horizntal appears to tilt clockwise. Also "availabe as a sticker":http://www.redbubble.com/people/rupertrussell/t-shirts/5356205-1-helmholtzs-angle-expansion !http://ih2.redbubble.net/work.5356205.1.sticker,375x360.helmholtzs-angle-expansion-v1.png!:http://www.redbubble.com/people/rupertrussell/t-shirts/5356205-1-helmholtzs-angle-expansion

00000010101010000000000 00101000001010000000100 10001000100010010110010 10101010101010100100100 00000000000000000000000 00000000000011000000000 00000000001101000000000 00000000001101000000000 00000000010101000000000 00000000011111000000000 00000000000000000000000 11000011100011000011000 10000000000000110010000 11010001100011000011010 11111011111011111011111 00000000000000000000000 00010000000000000000010 00000000000000000000000 00001000000000000000001 11111000000000000011111 00000000000000000000000 11000011000011100011000 10000000100000000010000 11010000110001110011010 11111011111011111011111 00000000000000000000000 00010000001100000000010 00000000001100000000000 00001000001100000000001 1111100000110000001111...

code on Github at: https://github.com/rupertrussell/SpiralWaves001

code on Github at: https://github.com/rupertrussell/SpiralWaves001

code on Github at: https://github.com/rupertrussell/SpiralWaves001

// based on https://www.openprocessing.org/sketch/453596 // cubes by beatriz t. int counter = 0; int scale = 4; void setup() { size (9411, 9411); background (0); } void draw () { // rotate (PI/6); for (int i = 30 * scale; i <= width; i += 60 * scale) { for (int j =30 * scale; j <= height; j +=60 * scale) { hexagono(i, j, 30 * scale); //base esquerda stroke(0); } } for (int i = 0; i <= width; i += 60 * scale) { for (int j =0; j <= height; j +=60 * scale) { hexagono (i, j, 20 * scale); } } } void hexagono (int posX, int posY, float lado) { for (float i= 0; i< 2* PI; i = i + PI/3) { pushMatrix(); fill (i * 42, mouseY, mouseX); fill (i * 42, 0, ...

Terminal Font see also: "Arecibo Message 001":http://rupert.id.au/tutorials/processing/examples/Arecibo_message_001/index.php 00000010101010000000000 00101000001010000000100 10001000100010010110010 10101010101010100100100 00000000000000000000000 00000000000011000000000 00000000001101000000000 00000000001101000000000 00000000010101000000000 00000000011111000000000 00000000000000000000000 11000011100011000011000 10000000000000110010000 11010001100011000011010 11111011111011111011111 00000000000000000000000 00010000000000000000010 00000000000000000000000 00001000000000000000001 11111000000000000011111 00000000000000000000000 11000011000011100011000 10000000100000000010000 11010000110001110011010 11111011111011...

// Daniel Shiffman //<>// // http://codingtra.in // http://patreon.com/codingtrain // Code for: https://youtu.be/KWoJgHFYWxY // Coding Challenge #30: Phyllotaxis // http://algorithmicbotany.org/papers/abop/abop-ch4.pdf // https://raw.githubusercontent.com/CodingTrain/Rainbow-Code/master/challenges/CC_30_Phyllotaxis/CC_30_Phyllotaxis.pde int n = 200016; float c = 8.5; float start = 0; float hu ; float radius = 0; int count = 0; int oldCount = 0; float rrr, ggg, bbb; int x = 0; void setup() { size(1000, 1000); // size(13500, 13500); //frameRate(4); background(0); stroke(0); strokeWeight(.5); println("Running"); } void draw() { dot(x); x ++; count ++; } void dot (int i) { transl...

// Created with Processing see processing.org // Licensed under Creative Commons Attribution ShareAlike // https://creativecommons.org/licenses/by-sa/3.0 // https://creativecommons.org/licenses/GPL/2.0/ // http://www.redbubble.com/people/rupertrussell // triangles_005_001 // 20170205 PVector a; PVector b; PVector c; float shrink = .9; float grey=0; float len = 27000; // ensure that this is larger thatn the camvas boolean black = true; void setup () { size(13500, 13500); background(255); noLoop(); smooth(); strokeWeight(1); stroke(grey); int size = 13500; a = new PVector(-size, -size, 0); b = new PVector(size, -size, 0); c = new PVector(0, size, 0); } void draw () { translate(width ...

// Created with Processing see processing.org // Licensed under Creative Commons Attribution ShareAlike // https://creativecommons.org/licenses/by-sa/3.0 // https://creativecommons.org/licenses/GPL/2.0/ // http://www.redbubble.com/people/rupertrussell // triangles_003_001 // 20170205 PVector a; PVector b; PVector c; float shrink = .9; float grey=0; float len = 4500; void setup () { size(3500, 3500); background(255); noLoop(); smooth(); strokeWeight(1); stroke(grey); int size = 800; a = new PVector(-size, -size, 0); b = new PVector(size, -size, 0); c = new PVector(0, size, 0); } void draw () { translate(width / 2, height /2); // a.mult(shrink); // b.mult(shrink); // c.mult(shr...

PVector a; PVector b; PVector c; float shrink = .9; float grey=0; float len = 16500; void setup () { size(13500, 13500); background(255); noLoop(); smooth(); strokeWeight(1); stroke(grey); int size = 800; a = new PVector(-size, -size, 0); b = new PVector(size, -size, 0); c = new PVector(0, 1300, 0); } void draw () { translate(width / 2, height /2); // a.mult(shrink); // b.mult(shrink); // c.mult(shrink); a.setMag(len); b.setMag(len); c.setMag(len); while (len > 1) { len = len -10; a.setMag(len); b.setMag(len); c.setMag(len); grey = grey + .01; triangle(a.x, a.y, b.x, b.y, c.x, c.y); rotate(radians(-0.5)); println ("len " +...