fractals

I'm writting some code about fractals and random terrain generation. Specifically, I'm using the Diamond-Square algorithm as of now. For those of you who don't know, it basically obtains the average of four values, and adds a random number, every step. How wouldI go about testing the result? Should I use a known seed and calculate by hand the average plus the random value, or what? Should I, instead, calculate the result in the code, using the random numbers? Or is there another way? Also, some thought on the reverse process (a.k.a. TDD, writting tests before code) would be much appreciated).

I would like to calculate dimensions of fractal written as a n-dimensional array of 0s and 1s. It includes boxing count, hausdorff and packing dimension. I have only idea how to code boxing count dimensions (just counting 1's in n-dimensional matrix and then use this formula: boxing_count=-log(v)/log(n); where n-number of 1's and n-space dimension (R^n) This approach simulate counting minimal resolution boxes 1 x 1 x ... x 1 so numerical it is like limit eps->0 . What do you think about this solution? Do you have any idea (or maybe code) for calculating hausdorff or packing dimension? The

I use the following Complex class file for Complex variables. The java code below is an example of iterations calculator for Mandelbrot Set. public int iterations(Complex no) { Complex z = no; int iterations = 0; while (z.modulusSquared() < 4 && iter <= MAX_ITERATIONS) { z = z.square(); z = z.add(y); iter++; } return iter; } Thanks in advance! I think in the function squared you need to use the absolute value: public Complex square() { double newreal; double newimaginary; newreal = ((real * real) - (imaginary * imaginary)); newimaginary = 2 * abs(imaginary * real); return new Complex(newreal,