Adult Apparel
Kids Apparel
Home Goods
Cases & Stickers
Related Tags
NOT MY IMAGE - This is a restoration, of sorts - trying to take a VERY small image, and see if I can turn it into an image large enough to be able to print - I used an image that is in the Creative Commons / Public Domain, so no trademark or copyright laws are in place to make anything an issue. Changes were made to the image to accommodate for distortions that happened as a result of the image scaling process.
Tags: commons, creative commons, public, domain, public domain
// 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
// 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
Created with Processing "Download the Code from my website":http://www.rupert.id.au/tutorials/processing/examples/radiation/radiation_template.php Code also available on "Github:"https://github.com/rupertrussell/Warning-Radiation-Sign-Template
Tags: algorithm, arc, code, creative commons, generative art
// 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
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, grid
// 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
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
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
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 = 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 = 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
// 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
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
// 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_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
Pin FAQ
Classic pin-back button covered with scratch and UV-resistant mylar. 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