Fractal Tree

[BenLi]

And now, for no reason at all...fractal tree

code:

%this creates a regular fractal tree, the angles are controlled by mouse's y position setscreen ("graphics:max,max") var cnt := 0 proc frac (x, y, ang, leng, n, ang2 : real)     if n > 0 then         Draw.ThickLine (round (x), round (y), round (((cosd (ang)) * leng) + x), round (((sind (ang)) * leng) + y), n div 3, 255)         frac (round (((cosd (ang)) * leng) + x), round (((sind (ang)) * leng) + y), ang + ang2, leng - 10, n - 1, ang2)         frac (round (((cosd (ang)) * leng) + x), round (((sind (ang)) * leng) + y), ang - ang2, leng - 10, n - 1, ang2)     end if end frac var mx, my, mb : int setscreen ("offscreenonly") loop     mousewhere (mx, my, mb)     frac (maxx div 2, 0, 90, 100, 7, (maxy - my) div 20)     View.Update     cls end loop

this is the one that has been randomized. I think it looks decent.

code:

setscreen ("graphics:max,max") var cnt := 0 proc frac (x, y, ang, leng, n : real)     if n > 8 then         Draw.ThickLine (round (x), round (y), round (((cosd (ang)) * leng) + x), round (((sind (ang)) * leng) + y), n div 2, RGB.AddColor (.3, .3, 0))     else         Draw.ThickLine (round (x), round (y), round (((cosd (ang)) * leng) + x), round (((sind (ang)) * leng) + y), n div 2, RGB.AddColor (0, Rand.Real, 0))     end if     if n > 0 then         frac (round (((cosd (ang)) * leng) + x), round (((sind (ang)) * leng) + y), ang + Rand.Int (5, 15), leng - Rand.Int (1, 5), n - 1)         frac (round (((cosd (ang)) * leng) + x), round (((sind (ang)) * leng) + y), ang - Rand.Int (5, 15), leng - Rand.Int (1, 5), n - 1)     end if end frac frac (maxx div 2, 0, 90, 50, 16)

[ericfourfour]

I like the last one, but the first runs a bit slow. What was the cnt variable for?

[BenLi]

the cnt variable wasn't used

[iamcow]

not bad, I liked the second one. However, the brown branches look kinda bare

[kshorting]

BenLi,

Thank you. Fun stuff. I'll be having some fun playing with this.

Thanks,

KS

[UraniumLobster]

Thats pretty sweet, it kept me busy for about 5 mins =P. Thats good considering its not even a game, pretty cool idea!

[Clayton]

UraniumLobster @ Wed Sep 12, 2007 10:11 am wrote:

Thats pretty sweet, it kept me busy for about 5 mins =P. Thats good considering its not even a game, pretty cool idea!

Things don't have to be games to be cool...

[cpu_hacker4.0]

man how do you figure that stuff out?

[Clayton]

Wikipedia is a fantastic resources for algorithms for fractals and such.

[cpu_hacker4.0]

Thanks, I'll be sure to check it out.

[CodeMonkey2000]

Also look up recursion in the Turing Walkthrough.

[cpu_hacker4.0]

ok thanks