"Nathan Kopp" <pov### [at] nkoppmailshellcom> wrote in
news:3e1714cf$1@news.povray.org 

> If it realy is O(n), which would be great, couldn't you simply
> generate an appropriate distribution each time, removing the need to
> order them.  If the algorithm produces evenly spaced samples for small
> counts, this would also ensure that small sample counts look their
> best. 

Why not generate array of arrays ?
array for count=3, count=4, count=5 etc... ?

taht would be much faster then generating in real-time, and will not use to 
much memory


-- 
#macro g(U,V)(.4*abs(sin(9*sqrt(pow(x-U,2)+pow(y-V,2))))*pow(1-min(1,(sqrt(
pow(x-U,2)+pow(y-V,2))*.3)),2)+.9)#end#macro p(c)#if(c>1)#local l=mod(c,100
);g(2*div(l,10)-8,2*mod(l,10)-8)*p(div(c,100))#else 1#end#end light_source{
y 2}sphere{z*20 9pigment{function{p(26252423)*p(36455644)*p(66656463)}}}//M

Post a reply to this message