2009年3月23日 星期一

Color Scheme

http://colorschemedesigner.com/
http://www.color-wheel-pro.com/

2009年3月16日 星期一

2D Gradation Pattern Sample code

int [][] gradationPattern = { {5, 4, 3, 4, 5},
{4, 3, 2, 3, 4},
{3, 2, 1, 2, 3},
{4, 3, 2, 3, 4},
{5, 4, 3, 4, 5} };
void setup() {
size (500, 500);
background(0);
}

void draw() {
noStroke();
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5; j++) {
int gp = gradationPattern[i][j];
drawUnit(i, j, gp);

}
}


}
void drawUnit(int i, int j, int gp) {

switch (gp) {
case 1:
fill(gp*50);
rect(i*100, j*100, 100, 100);
break;
case 2:
fill(gp*50);
ellipse(i*100+50, j*100+50, 100, 100);
break;
default:
break;

}
}

2D array sample code 1

float[][] distances;
float maxDistance;
void setup() {
size(200, 200);
background(0);
}
void draw() {
float d1, d2, d3, d4;
d1 = dist(mouseX, mouseY, 0, 0);
d2 = dist(mouseX, mouseY, width, height);
d3 = dist(mouseX, mouseY, 0, height);
d4 = dist(mouseX, mouseY, width, 0);
maxDistance = max(d1, d2, d3);
maxDistance = max(d4, maxDistance);
distances = new float[width][height];
for(int i=0; i < height; i++) {
for(int j=0; j < width; j++) {
float d = dist(mouseX, mouseY, j, i);
distances[j][i] = d/maxDistance * 255;
}
}
for(int i=0; i < height; i+=2) {
for(int j=0; j < width; j+=2) {
stroke(distances[j][i]);
point(j, i);
}
}
}

2009年3月15日 星期日

learning Array

http://www.processing.org/learning/basics/array2d.html
http://www.processing.org/learning/2darray/

練習 pattern based gradiation