The cod that I posted is O(n), and the code that "moves the samples a bit
around" is O(n^2) indeed. And so is the code that orders the stuff. However,
I'm still trying to get a better ordering. Or I could precalculate tons of
sets for count 1, count 2, ..., count 3199, count 3200. It takes some time
and space, but renderings with low counts will have less artifacts then.
Let's say that a*quality+b*resources-c=0  :-)

Post a reply to this message