Adult Apparel
Kids Apparel
Home Goods
Cases & Stickers
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 = 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); } 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
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
// 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
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_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
// 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
// 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
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
Steps: Open Photoshop. Select the area you want to tile (you can press 'm' for the select tool and click/drag to select an area) From the menu select Edit->Define Pattern. Name your pattern and click OK. Select the Paint Bucket tool (press 'g') Change the Source from Foreground to Pattern int cubeSide = 450; int cornerSize = 190; int border = 10; void setup() { size(900, 900); background(255,0,0); } void draw() { noLoop(); noFill(); strokeCap(MITER); // Translate the the center of the screen translate(width /2, height /2); // ellipse(0, 0, 5, 5); noStroke(); fill(180, 180, 180); // front top left pushMatrix(); translate(cubeSide * -3/4, cubeSide * - 1/4); fill(255); e...
Tags: algorithm, code, creative commons, cube, dots
// Inspired by https://www.dreamstime.com/stock-images-rainbow-polka-dots-image5604994 // https://krazydad.com/tutorials/makecolors.php int dotSize = 200; int dotSpace = 20; int angle = 0; float red, grn, blu; float frequency1 = .6; // red float frequency2 = .6; // green float frequency3 = .3; // blue int phase1 = 0; int phase2 = 2; int phase3 = 4; void setup () { size(13500, 11462); background(0); smooth(); } void draw () { noLoop(); for (int y = 1; y < height / (dotSpace + dotSize); y++) { for (int x = 1; x < width / (dotSpace + dotSize); x ++) { red = abs(sin(frequency1 * y / 5 + phase1) * 300); grn = abs(sin(frequency2 * y / 5 + phase2) * 300); blu = abs(...
Tags: algorithm, code, dots, generative design, processing
// Inspired by https://www.dreamstime.com/stock-images-rainbow-polka-dots-image5604994 // https://krazydad.com/tutorials/makecolors.php int dotSize = 200; int dotSpace = 20; int angle = 0; float red, grn, blu; float frequency1 = .6; // red float frequency2 = .6; // green float frequency3 = .3; // blue int phase1 = 0; int phase2 = 2; int phase3 = 4; void setup () { size(13500, 11462); background(0); smooth(); } void draw () { noLoop(); for (int y = 1; y < height / (dotSpace + dotSize); y++) { for (int x = 1; x < width / (dotSpace + dotSize); x ++) { red = abs(sin(frequency1 * y / 5 + phase1) * 300); grn = abs(sin(frequency2 * y / 5 + phase2) * 300); blu = abs(...
Tags: algorithm, code, dots, generative design, processing
//"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 ...
Tags: algorithm, code, generative design, open processing, rupertrussell
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(); } }
Tags: algorithm, code, generative design, monochrome, processing
// 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 = 6000; int screenHeight = 6000; void setup() { size(6000, 6000); background(0); // black background stroke(255,255,255); strokeWeight(3); // thin lines smooth(); // antialias lines } float rad; float theta; float x; float y; float r; void draw() { for (rad = 1; rad < 300; rad ++) { for (theta = 0; theta <= 10 * PI; theta += 0.01) { r = rad * (8 + sin(theta * 10 + rad / 40)); // "rad/20" gives the figure a slight phase shift as it grows larger x = r * cos(theta) + screenWidth / 2;...
Tags: algorithm, code, flower, generative, generative design
Get lost in the perfect blend of fantasy and machinery with our stunning tee designs! Intricate gears and pistons combine with mythical dragons, whose fiery red scales transition to ocean blues, creating a captivating piece of art. Perfect for those who appreciate the marvels of industrial dragon mechanics!
Tags: ai art, asian dragon, chinese dragon, chinese new year 2024, digital artwork
Get lost in the perfect blend of fantasy and machinery with our stunning tee designs! Intricate gears and pistons combine with mythical dragons, whose fiery red scales transition to ocean blues, creating a captivating piece of art. Perfect for those who appreciate the marvels of industrial dragon mechanics!
Tags: ai art, asian dragon, chinese dragon, chinese new year, chinese new year 2024
// 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 int n = 200010; float c = 8.5; float start = 0; float hu ; float radius; float rrr, ggg, bbb; void setup() { // size(13500, 13500); size(5000, 5000); // colorMode(HSB, 360, 255, 255); background(0); stroke(0); strokeWeight(.5); 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 = i *...
Tags: algorithm, code, creative commons, dots, generative design processing
Magnet FAQ
0.5mm (20mil) flexible vinyl. Black magnetic backing strong enough to hold notes, photos, and drawings. Recommended for indoor use. Printed in the U.S.A.
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