mrcm(N, start, flag) constructs a fractal picture |
by the principle of a MRCM (multiple reduction copy machine).
The algorithm stops after each iteration.
N is the number of iterations.
start determines the basic item:
start = 0 uses a triangle, otherwise a square is used.
flag chooses the form of the picture:
flag = 0 results in the Sierpinski triangle;
flag = 1 draws the Koch curve;
flag = 2 shows a fractal tree;
flag = 3 returns a fractal farn leaf;
otherwise a christmas tree is constructed.
mrcm(N) draws the farn leaf at N iterations using a square.
mrcm draws 8 iterations of the farn leaf.
Usage: Type unzip mrcm.zip
Contents: mrcm.m chrtree.m farn.m frbaum.m koch.m sierdr.m startbild.m var_startbild.m
This file was generated by students as a partial fulfillment
for the requirements of the course "Fractals",
2004/2005, Stuttgart University.