【发布时间】:2010-04-08 03:14:53
【问题描述】:
谁能帮我用c语言编写计算机图形中自相似分形的编程代码?
【问题讨论】:
-
可能有人可以。或许你可以问一个更具体的问题?
-
stat here - en.wikipedia.org/wiki/Fractals :: 然后回来发布一个特定的查询。
谁能帮我用c语言编写计算机图形中自相似分形的编程代码?
【问题讨论】:
这应该足以让您入门。这在 ascii 中绘制了一个 julia 集。 如果您想绘制 mandelbrot 集,请迭代 c 而不是 z。
#include <stdio.h>
typedef struct tag_complex
{
double real, imag;
} complex;
static complex complex_mul(
const complex* a,
const complex* b)
{
/* a * b = (a_real + i*a_imag)(b_real + i*b_imag) */
/* i*i = -1, hence imag*imag becomes -(imag*imag) */
complex ret;
ret.real = a->real*b->real - a->imag*b->imag;
ret.imag = a->real*b->imag + a->imag*b->real;
return ret;
}
static complex complex_add(
const complex* a,
const complex* b)
{
complex ret;
ret.real = a->real + b->real;
ret.imag = a->imag + b->imag;
return ret;
}
static int julia(
complex* z,
const complex* c,
int maxIter)
{
double lengthSquared;
int iter = 0;
while(iter < maxIter){
++iter;
*z = complex_mul(z, z);
*z = complex_add(z, c);
lengthSquared = z->real*z->real + z->imag*z->imag;
/* If the point escapes the radius 2
in the complex plane, it's in the set */
if(lengthSquared > 4.0)
return iter;
}
/* Point didn't escape. Either it's not in the set,
or we need more iterations.*/
return 0;
}
int main(int argc, char* argv[])
{
const int width = 80;
const int height = 40;
const int maxIter = 512;
/* step in the range [0, 4] since the set
lives within [-2, 2] in the complex space */
const double step_height = 4.0 / (double)height;
const double step_width = 4.0 / (double)width;
/*c is constant for julia sets. z is iterated over */
const complex c = {0.285, 0.0};
complex z;
int index;
char ch;
for(int j=0; j<height; ++j){
for(int i=0; i<width; ++i){
/* Get interpolants within [-2, 2] range */
z.imag = ((double)j * step_height) - 2.0;
z.real = ((double)i * step_width) - 2.0;
index = julia(&z, &c, maxIter);
ch = (index % ('Z' - ' ')) + ' ';
printf("%c", ch);
}
printf("\n");
fflush(stdout);
}
}
【讨论】: