Simen Kvaal wrote:

> My personally (!) implemented fourth order Runge-Kutta algorithm calcluated
> two million points in about five seconds. Not bad? (Or so I'd like to
> believe.) This is a two hour render, moslty because of the depth-four
> antialiasing with threshold zero. (Threshold 0.01 made some of the thin
> lines dissappear, so I thought what the heck and went to dinner. :)

For some scene, you may want to render at, say, a resolution of 8k x 6k and
then use some intelligent viewer to resize to a more modest size. This usually
deals with aliases due to very small objects.

By the way, care to share the implementation of the R-K algorithm ?


Best,

    S.



>
>
> Problem: The region where the lower "wing" is partially covered with the
> upper one is kind of messy. I guess it is because of the nature of
> aliasing/antialiasing. Would depth 5 or higher have any effect? What about
> renering larger and rescaling? I don't have time for such things right now,
> though ...
>
> Regards.
>
> --
> ---------------------------------------------
> Simen Kvaal
>
> Student at the faculty of mathematics and
> natural sciences, University of Oslo, Norway.
> Webmaster for \hbar (Fysikkforeningen).
>
> e-mail: sim### [at] studentmatnatuiono
> web: http://www.uio.no/~simenkv/
> ---------------------------------------------
>
>  [Image]



--
----------------------------------------------------------
Steven Pigeon                     Ph. D. Student.
University of Montreal.
pig### [at] iroumontrealca           Topics: data compression,
pig### [at] jspumontrealca          signal processing,
ste### [at] researchattcom           non stationnary signals
                                  and wavelets.
----------------------------------------------------------
         http://www.iro.umontreal.ca/~pigeon

Post a reply to this message