Adult Apparel
Kids Apparel
Home Goods
Cases & Stickers
// 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...
Tags: algorithm, code, creative commons, dots, generative design
// 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 ...
Tags: algorithm, code, creative commons, dots, generative design
// 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 ...
Tags: algorithm, code, creative commons, dots, generative design
// 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, 13500); // size(1350, 1350 ); colorMode(HSB, 360, 255, 255); background(0); stroke(0); strokeWeight(2); 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 a ...
Tags: algorithm, code, creative commons, dots, generative design
// 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(...
Tags: algorithm, code, creative commons, dots, generative design
// Improved Code with correct gap sizes v2 // 13/01/2018 // Biohazard Warning Symbol // Code by Rupert Russell // [email protected] // Released under Creative Commons Licence // Licensed under Creative Commons Attribution ShareAlike // https://creativecommons.org/licenses/by-sa/3.0 // https://creativecommons.org/licenses/GPL/2.0/ // Based on the design https://cws.auburn.edu/shared/content/files/1621/biohazard-history.pdf // https://archive.org/stream/federalregister39kunit#page/n849/mode/1up //http://99percentinvisible.org/article/biohazard-symbol-designed-to-be-memorable-but-meaningless/ float a = 90; // Basic Unit size of Warning symbol float b = 3.5 * a; float c = 4 * a; float d = 6 * a; float e = 11 * a;...
Tags: algorithm, biohazard, caution, code, generative design
// Post Production in Photoshop // 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)...
Tags: algorithm, code, creative commons, dots, generative design
// 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...
Tags: algorithm, code, creative commons, dots, generative design
// 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...
Tags: algorithm, code, creative commons, dots, generative design
// 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(...
Tags: algorithm, code, creative commons, dots, generative design
// 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 ...
Tags: algorithm, code, creative commons, dots, generative design
...Two contrasting colors, representing the dualism of our existence. Where the black path is finished, the white takes over the flow, saying that "The night is darkest just before the dawn". Constant overlaping of these lines forms a unique confusing pattern symolizing the everlasting battle between good and evil, love and hate, light and darkness......Black and white diagonal inclined lines. Illusive and delusional texture. Seamless geometric pattern. Optical illusion effect. Flat design. Modern illustration. Strippy, psychedelic print in op art style...
Tags: abstract, black and white, generative art, geometric pattern, illusive
void setup() { size(13500, 11462 ); background(0); } float r=0; float g=0; float b=0; float y; float size = 2000; float click; float step = 2; void draw() { fill(r, g, b); noStroke(); for (float x = 0; x < width; x = x + size) { ellipse(x, y, size, size); if ( r <= 255 && g == 0 && b == 0 ) { r = r + step; } if ( r >= 255 && g < 255 && b <= 0 ) { g = g + step; } if ( g >= 255 && r > 0 && b <= 0 ) { r = r - step; } if ( g >= 255 && b < 255 && r <= 0 ) { b = b + step; } if ( b >= 255 && g > 0 && r <= 0 ) { g = g - step; ; } if ( b >= 255 && r < 255 && g <= 0 ) { r = r + s...
Tags: algorithm, code, creative commons, dots, generative design
void setup() { size(13500, 11462 ); background(0); } float r=0; float g=0; float b=0; float y; float size = 100; float click; float step = 2; void draw() { fill(r, g, b); for (float x = 0; x < width; x = x + size) { ellipse(x, y, size, size); if ( r <= 255 && g == 0 && b == 0 ) { r = r + step; } if ( r >= 255 && g < 255 && b <= 0 ) { g = g + step; } if ( g >= 255 && r > 0 && b <= 0 ) { r = r - step; } if ( g >= 255 && b < 255 && r <= 0 ) { b = b + step; } if ( b >= 255 && g > 0 && r <= 0 ) { g = g - step; ; } if ( b >= 255 && r < 255 && g <= 0 ) { r = r + step; ; ...
Tags: algorithm, code, creative commons, dots, generative design
void setup() { size(13500, 11462 ); background(0); } float r=0; float g=0; float b=0; float y; float size = 500; float click; float step = 2; void draw() { fill(r, g, b); for (float x = 0; x < width; x = x + size) { ellipse(x, y, size, size); if ( r <= 255 && g == 0 && b == 0 ) { r = r + step; } if ( r >= 255 && g < 255 && b <= 0 ) { g = g + step; } if ( g >= 255 && r > 0 && b <= 0 ) { r = r - step; } if ( g >= 255 && b < 255 && r <= 0 ) { b = b + step; } if ( b >= 255 && g > 0 && r <= 0 ) { g = g - step; ; } if ( b >= 255 && r < 255 && g <= 0 ) { r = r + step; ; ...
Tags: algorithm, code, creative commons, dots, generative design
void setup() { size(13500, 11462 ); background(0); } float r=0; float g=0; float b=0; float y; float size = 900; float click; float step = 2; void draw() { fill(r, g, b); noStroke(); for (float x = 0; x < width; x = x + size) { ellipse(x, y, size, size); if ( r <= 255 && g == 0 && b == 0 ) { r = r + step; } if ( r >= 255 && g < 255 && b <= 0 ) { g = g + step; } if ( g >= 255 && r > 0 && b <= 0 ) { r = r - step; } if ( g >= 255 && b < 255 && r <= 0 ) { b = b + step; } if ( b >= 255 && g > 0 && r <= 0 ) { g = g - step; ; } if ( b >= 255 && r < 255 && g <= 0 ) { r = r + st...
Tags: algorithm, code, creative commons, dots, generative design
void setup() { size(13500, 11462 ); background(0); } int r=100; int g=0; int b=0; int y; int size = 100; int click; int step = 15; void draw() { if ( r <= 255 && g == 0 && b == 0 ) { r = r + step; } if ( r >= 255 && g < 255 && b <= 0 ) { g = g + step; } if ( g >= 255 && r > 0 && b <= 0 ) { r = r - step; } if ( g >= 255 && b < 255 && r <= 0 ) { b = b + step; } if ( b >= 255 && g > 0 && r <= 0 ) { g = g - step; ; } if ( b >= 255 && r < 255 && g <= 0 ) { r = r + step; ; } if ( r >= 255 && b > 0 && g <= 0 ) { b = b - step; ; } fill(r, g, b); println("r = " + r); println("g = " + g); println("b = ...
Tags: algorithm, code, creative commons, dots, generative design
void setup() { size(13500, 11462 ); background(0); } float r=0; float g=0; float b=0; float y; float size = 900; float click; float step = 2; void draw() { fill(r, g, b); noStroke(); for (float x = 0; x < width; x = x + size) { ellipse(x, y, size, size); if ( r <= 255 && g == 0 && b == 0 ) { r = r + step; } if ( r >= 255 && g < 255 && b <= 0 ) { g = g + step; } if ( g >= 255 && r > 0 && b <= 0 ) { r = r - step; } if ( g >= 255 && b < 255 && r <= 0 ) { b = b + step; } if ( b >= 255 && g > 0 && r <= 0 ) { g = g - step; ; } if ( b >= 255 && r < 255 && g <= 0 ) { r = r + st...
Tags: algorithm, code, creative commons, dots, generative design
void setup() { size(13500, 11462 ); background(0); } float r=0; float g=0; float b=0; float y; float size = 900; float click; float step = 2; void draw() { fill(r, g, b); noStroke(); for (float x = 0; x < width; x = x + size) { ellipse(x, y, size, size); if ( r <= 255 && g == 0 && b == 0 ) { r = r + step; } if ( r >= 255 && g < 255 && b <= 0 ) { g = g + step; } if ( g >= 255 && r > 0 && b <= 0 ) { r = r - step; } if ( g >= 255 && b < 255 && r <= 0 ) { b = b + step; } if ( b >= 255 && g > 0 && r <= 0 ) { g = g - step; ; } if ( b >= 255 && r < 255 && g <= 0 ) { r = r + st...
Tags: algorithm, code, creative commons, dots, generative design
void setup() { size(13500, 11462 ); background(0); } float r=0; float g=0; float b=0; float y; float size = 500; float click; float step = 2; void draw() { fill(r, g, b); for (float x = 0; x < width; x = x + size) { ellipse(x, y, size, size); if ( r <= 255 && g == 0 && b == 0 ) { r = r + step; } if ( r >= 255 && g < 255 && b <= 0 ) { g = g + step; } if ( g >= 255 && r > 0 && b <= 0 ) { r = r - step; } if ( g >= 255 && b < 255 && r <= 0 ) { b = b + step; } if ( b >= 255 && g > 0 && r <= 0 ) { g = g - step; ; } if ( b >= 255 && r < 255 && g <= 0 ) { r = r + step; ; ...
Tags: algorithm, code, creative commons, dots, generative design
// 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 Code on Github at: https://github.com/rupertrussell/pattern010
Tags: algorithm, code, creative commons, generative design, linear
// 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...
Tags: algorithm, code, creative commons, dots, generative design
// 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 ...
Tags: algorithm, code, creative commons, generative design, linear
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 " +...
Tags: algorithm, code, creative commons, generative design, linear
// 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...
Tags: algorithm, code, creative commons, generative design, linear
// Phyllotaxis by Rupert Russell // based on code by Daniel Shiffman // Licensed under Creative Commons Attribution ShareAlike // https://creativecommons.org/licenses/by-sa/3.0 // https://creativecommons.org/licenses/GPL/2.0/ // 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 // http://www.timvandevall.com/wp-content/uploads/2013/08/Color-Wheel-Template-06.png // int n = 200016; float c = 8.5; float start = 0; float hu ; float radius = 0; int count = 0; int oldCount = 0; int dot...
Tags: algorithm, code, creative commons, dots, generative design
// Phyllotaxis by Rupert Russell // based on code by Daniel Shiffman // Licensed under Creative Commons Attribution ShareAlike // https://creativecommons.org/licenses/by-sa/3.0 // https://creativecommons.org/licenses/GPL/2.0/ // 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 // http://www.timvandevall.com/wp-content/uploads/2013/08/Color-Wheel-Template-06.png // int n = 200016; float c = 8.5; float start = 0; float hu ; float radius = 0; int count = 0; int oldCount = 0; int dot...
Tags: algorithm, code, creative commons, dots, generative design
Inspired by "Flint":http://www.redbubble.com/people/geometee/works/9499665-flint !http://ih0.redbubble.net/image.12765418.9665/sticker,220x200-bg,ffffff-pad,220x200,ffffff.u3.jpg!:http://www.redbubble.com/people/geometee/works/9499665-flint // 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/ PVector a; PVector b; PVector c; float shrink = .9; float grey=0; float len = 4000; void setup () { size(2800, 2800); background(255); noLoop(); smooth(); strokeWeight(1); stroke(grey); int size = 800; a = new PVector(-size, -size, 0); b = new PVector(si...
Tags: algorithm, code, creative commons, generative design, linear
// 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 = 9000; // boolean black = true; void setup () { size(5748, 5748); background(255); noLoop(); smooth(); strokeWeight(1); stroke(grey); int size = 7900; 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.setMag(len); b.setMa...
Tags: algorithm, code, creative commons, generative design, linear
Baseball Tee FAQ
52% cotton/48% polyester. A super light and soft classic baseball tee with contrasting neckline and 3/4 sleeves. Unisex sizing (women may want to size down for a slimmer fit).
UPS MI Domestic (6-8 Business Days)
FedEx 2-Day (4-6 Business Days)
Estimates include printing and processing time.More Shipping Info
We want you to love your order! If for any reason you don't, let us know and we’ll make things right.Learn More