| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 1 | 2 | 3 | 4 | 5 | 6 | |
| 7 | 8 | 9 | 10 | 11 | 12 | 13 |
| 14 | 15 | 16 | 17 | 18 | 19 | 20 |
| 21 | 22 | 23 | 24 | 25 | 26 | 27 |
| 28 | 29 | 30 |
| dither (0) | 2009.02.14 |
|---|---|
| [DUT] Fundamentals of Image Processing (0) | 2008.07.22 |
| [Gonzalez & Woods] Digital Image Processing (0) | 2008.07.08 |
| Natural Computing Series (0) | 2008.07.06 |
| (ref) A Multi-Resolution Video Scheme for Multimedia Information Servers in Mobile Computing Environment (0) | 2008.05.21 |
| Ant Colony Optimization (ACO) (0) | 2010.07.04 |
|---|---|
| [DUT] Fundamentals of Image Processing (0) | 2008.07.22 |
| [Gonzalez & Woods] Digital Image Processing (0) | 2008.07.08 |
| Natural Computing Series (0) | 2008.07.06 |
| (ref) A Multi-Resolution Video Scheme for Multimedia Information Servers in Mobile Computing Environment (0) | 2008.05.21 |
invalid-file
Fundamentals of Image Processing (Delft University of Technology)
| Ant Colony Optimization (ACO) (0) | 2010.07.04 |
|---|---|
| dither (0) | 2009.02.14 |
| [Gonzalez & Woods] Digital Image Processing (0) | 2008.07.08 |
| Natural Computing Series (0) | 2008.07.06 |
| (ref) A Multi-Resolution Video Scheme for Multimedia Information Servers in Mobile Computing Environment (0) | 2008.05.21 |
| dither (0) | 2009.02.14 |
|---|---|
| [DUT] Fundamentals of Image Processing (0) | 2008.07.22 |
| Natural Computing Series (0) | 2008.07.06 |
| (ref) A Multi-Resolution Video Scheme for Multimedia Information Servers in Mobile Computing Environment (0) | 2008.05.21 |
| sorting algorithms (0) | 2008.03.24 |
| [DUT] Fundamentals of Image Processing (0) | 2008.07.22 |
|---|---|
| [Gonzalez & Woods] Digital Image Processing (0) | 2008.07.08 |
| (ref) A Multi-Resolution Video Scheme for Multimedia Information Servers in Mobile Computing Environment (0) | 2008.05.21 |
| sorting algorithms (0) | 2008.03.24 |
| fractal flame (0) | 2007.12.29 |
| [Gonzalez & Woods] Digital Image Processing (0) | 2008.07.08 |
|---|---|
| Natural Computing Series (0) | 2008.07.06 |
| sorting algorithms (0) | 2008.03.24 |
| fractal flame (0) | 2007.12.29 |
| steering vector (0) | 2007.06.25 |
| Natural Computing Series (0) | 2008.07.06 |
|---|---|
| (ref) A Multi-Resolution Video Scheme for Multimedia Information Servers in Mobile Computing Environment (0) | 2008.05.21 |
| fractal flame (0) | 2007.12.29 |
| steering vector (0) | 2007.06.25 |
| Boids (0) | 2007.06.21 |
invalid-file
The Fractal Flame Algorithm
| (ref) A Multi-Resolution Video Scheme for Multimedia Information Servers in Mobile Computing Environment (0) | 2008.05.21 |
|---|---|
| sorting algorithms (0) | 2008.03.24 |
| steering vector (0) | 2007.06.25 |
| Boids (0) | 2007.06.21 |
| Particle System (0) | 2007.04.30 |
| sorting algorithms (0) | 2008.03.24 |
|---|---|
| fractal flame (0) | 2007.12.29 |
| Boids (0) | 2007.06.21 |
| Particle System (0) | 2007.04.30 |
| Pseudo-random (0) | 2007.04.27 |
Craig W. Reynolds called the generic simulated flocking creatures boids. The basic flocking model consists of three simple steering behaviors which describe how an individual boid maneuvers based on the positions and velocities its nearby flockmates.
initialise_positions()
LOOP
draw_boids()
move_all_boids_to_new_positions()
END LOOP
PROCEDURE move_all_boids_to_new_positions()
Vector v1, v2, v3
Boid b
FOR EACH BOID b
v1 = rule1(b)
v2 = rule2(b)
v3 = rule3(b)
b.velocity = b.velocity + v1 + v2 + v3
b.position = b.position + b.velocity
END
END PROCEDURE
| fractal flame (0) | 2007.12.29 |
|---|---|
| steering vector (0) | 2007.06.25 |
| Particle System (0) | 2007.04.30 |
| Pseudo-random (0) | 2007.04.27 |
| noise (0) | 2007.04.21 |
invalid-file
Willian T. Reeves <Particle Systems—a Technique for Modeling a Class of Fuzzy Objects>
invalid-file
Karl Sims <Particle animation and rendering using data parallel computation>
invalid-file
Alain Fournier (University of Toronto) & Don Fussell (The University of Texas at Austin) & Loren Carpenter (Lucasfilm) <Computer Rendering of Stochastic Models>
| steering vector (0) | 2007.06.25 |
|---|---|
| Boids (0) | 2007.06.21 |
| Pseudo-random (0) | 2007.04.27 |
| noise (0) | 2007.04.21 |
| Perlin Noise (0) | 2007.04.21 |
| steering vector (0) | 2007.06.25 |
|---|---|
| Boids (0) | 2007.06.21 |
| Particle System (0) | 2007.04.30 |
| noise (0) | 2007.04.21 |
| Perlin Noise (0) | 2007.04.21 |
| steering vector (0) | 2007.06.25 |
|---|---|
| Boids (0) | 2007.06.21 |
| Particle System (0) | 2007.04.30 |
| Pseudo-random (0) | 2007.04.27 |
| Perlin Noise (0) | 2007.04.21 |
invalid-file
the algorithm Ken Perlin described in the SIGGRAPH 2002 paper
#include <stdlib.h>
#include <stdio.h>
#include <math.h>
float bias(float a, float b)
{
return pow(a, log(b) / log(0.5));
}
float gain(float a, float b)
{
float p = log(1. - b) / log(0.5);
if (a < .001)
return 0.;
else if (a > .999)
return 1.;
if (a < 0.5)
return pow(2 * a, p) / 2;
else
return 1. - pow(2 * (1. - a), p) / 2;
}
float noise1(float arg);
float noise2(float vec[]);
float noise3(float vec[]);
float noise(float vec[], int len)
{
switch (len) {
case 0:
return 0.;
case 1:
return noise1(vec[0]);
case 2:
return noise2(vec);
default:
return noise3(vec);
}
}
float turbulence(float *v, float freq)
{
float t, vec[3];
for (t = 0. ; freq >= 1. ; freq /= 2) {
vec[0] = freq * v[0];
vec[1] = freq * v[1];
vec[2] = freq * v[2];
t += fabs(noise3(vec)) / freq;
}
return t;
}
/* noise functions over 1, 2, and 3 dimensions */
#define B 0x100
#define BM 0xff
#define N 0x1000
#define NP 12 /* 2^N */
#define NM 0xfff
static p[B + B + 2];
static float g3[B + B + 2][3];
static float g2[B + B + 2][2];
static float g1[B + B + 2];
static start = 1;
static void init(void);
#define s_curve(t) ( t * t * (3. - 2. * t) )
#define lerp(t, a, b) ( a + t * (b - a) )
#define setup(i,b0,b1,r0,r1)\
t = vec[i] + N;\
b0 = ((int)t) & BM;\
b1 = (b0+1) & BM;\
r0 = t - (int)t;\
r1 = r0 - 1.;
float noise1(float arg)
{
int bx0, bx1;
float rx0, rx1, sx, t, u, v, vec[1];
vec[0] = arg;
if (start) {
start = 0;
init();
}
setup(0, bx0,bx1, rx0,rx1);
sx = s_curve(rx0);
u = rx0 * g1[ p[ bx0 ] ];
v = rx1 * g1[ p[ bx1 ] ];
return lerp(sx, u, v);
}
float noise2(float vec[2])
{
int bx0, bx1, by0, by1, b00, b10, b01, b11;
float rx0, rx1, ry0, ry1, *q, sx, sy, a, b, t, u, v;
register i, j;
if (start) {
start = 0;
init();
}
setup(0, bx0,bx1, rx0,rx1);
setup(1, by0,by1, ry0,ry1);
i = p[ bx0 ];
j = p[ bx1 ];
b00 = p[ i + by0 ];
b10 = p[ j + by0 ];
b01 = p[ i + by1 ];
b11 = p[ j + by1 ];
sx = s_curve(rx0);
sy = s_curve(ry0);
#define at2(rx,ry) ( rx * q[0] + ry * q[1] )
q = g2[ b00 ] ; u = at2(rx0,ry0);
q = g2[ b10 ] ; v = at2(rx1,ry0);
a = lerp(sx, u, v);
q = g2[ b01 ] ; u = at2(rx0,ry1);
q = g2[ b11 ] ; v = at2(rx1,ry1);
b = lerp(sx, u, v);
return lerp(sy, a, b);
}
float noise3(float vec[3])
{
int bx0, bx1, by0, by1, bz0, bz1, b00, b10, b01, b11;
float rx0, rx1, ry0, ry1, rz0, rz1, *q, sy, sz, a, b, c, d, t, u, v;
register i, j;
if (start) {
start = 0;
init();
}
setup(0, bx0,bx1, rx0,rx1);
setup(1, by0,by1, ry0,ry1);
setup(2, bz0,bz1, rz0,rz1);
i = p[ bx0 ];
j = p[ bx1 ];
b00 = p[ i + by0 ];
b10 = p[ j + by0 ];
b01 = p[ i + by1 ];
b11 = p[ j + by1 ];
t = s_curve(rx0);
sy = s_curve(ry0);
sz = s_curve(rz0);
#define at3(rx,ry,rz) ( rx * q[0] + ry * q[1] + rz * q[2] )
q = g3[ b00 + bz0 ] ; u = at3(rx0,ry0,rz0);
q = g3[ b10 + bz0 ] ; v = at3(rx1,ry0,rz0);
a = lerp(t, u, v);
q = g3[ b01 + bz0 ] ; u = at3(rx0,ry1,rz0);
q = g3[ b11 + bz0 ] ; v = at3(rx1,ry1,rz0);
b = lerp(t, u, v);
c = lerp(sy, a, b);
q = g3[ b00 + bz1 ] ; u = at3(rx0,ry0,rz1);
q = g3[ b10 + bz1 ] ; v = at3(rx1,ry0,rz1);
a = lerp(t, u, v);
q = g3[ b01 + bz1 ] ; u = at3(rx0,ry1,rz1);
q = g3[ b11 + bz1 ] ; v = at3(rx1,ry1,rz1);
b = lerp(t, u, v);
d = lerp(sy, a, b);
return lerp(sz, c, d);
}
static void normalize2(float v[2])
{
float s;
s = sqrt(v[0] * v[0] + v[1] * v[1]);
v[0] = v[0] / s;
v[1] = v[1] / s;
}
static void normalize3(float v[3])
{
float s;
s = sqrt(v[0] * v[0] + v[1] * v[1] + v[2] * v[2]);
v[0] = v[0] / s;
v[1] = v[1] / s;
v[2] = v[2] / s;
}
static void init(void)
{
int i, j, k;
for (i = 0 ; i < B ; i++) {
p[i] = i;
g1[i] = (float)((random() % (B + B)) - B) / B;
for (j = 0 ; j < 2 ; j++)
g2[i][j] = (float)((random() % (B + B)) - B) / B;
normalize2(g2[i]);
for (j = 0 ; j < 3 ; j++)
g3[i][j] = (float)((random() % (B + B)) - B) / B;
normalize3(g3[i]);
}
while (--i) {
k = p[i];
p[i] = p[j = random() % B];
p[j] = k;
}
for (i = 0 ; i < B + 2 ; i++) {
p[B + i] = p[i];
g1[B + i] = g1[i];
for (j = 0 ; j < 2 ; j++)
g2[B + i][j] = g2[i][j];
for (j = 0 ; j < 3 ; j++)
g3[B + i][j] = g3[i][j];
}
}
| steering vector (0) | 2007.06.25 |
|---|---|
| Boids (0) | 2007.06.21 |
| Particle System (0) | 2007.04.30 |
| Pseudo-random (0) | 2007.04.27 |
| noise (0) | 2007.04.21 |