Thanks. Recursion levels are comprised between 4 and 7 (over 7 parsing time really
gets
bad).
The pictures (extree*.jpg) correspond to the examples extree*.pov in the zip file, and
the recursion level is called level0.
Gilles

Spider wrote:

> Now this is SOO sweeeeeeeeeeeeet...
> How many recursions do you use?
> is it variable at choice(limbing)?
> how... how . how...
>
> Well, I think I have to get to the source now :-)
> Thanx for the job. :-)
>
> Gilles Tran wrote:
> >
> > Hello
> > Thanks for all the useful comments to the tree picture I posted a few days ago.
> > You can now find the MakeTree macro in pov.binaries.utilities.
> > And yes, it does roots (thanks Ken) and exports to *.inc files  on request.
> > The zip file contains 6 examples you can use as templates.
> > Here are the rendered examples below.
> >
> > Gilles Tran
> >
> > Render stats at 320*240, aa0.3 (Pentium Pro 200, 64 RAM)
> > Example            1       2       3       4       5        6
> > Objects          26600    8880    7600    1900    4000    28200
> > Peak memory (Mb) 20.6      8.7     7.6    1.3      2.7     21.7
> > Parse time       2m24s    1m7s    1m9s    8s      22s     2m50s
> > Trace time       5m6s     4m28s   3m18s  3m4s    6m10s    5m49s
> >
> >   --------------------------------------------------------------------------------
> >  [Image]  [Image]  [Image]  [Image]  [Image]  [Image]
>
> --
> //Spider
>         [ spi### [at] bahnhofse ]-[ http://www.bahnhof.se/~spider/ ]
> What I can do and what I could do, I just don't know anymore
>                 "Marian"
>         By: "Sisters Of Mercy"

Post a reply to this message