<p>Bikker said that? Are you thinking of this thread:<br>
<a href="http://ompf2.com/viewtopic.php?f=6&t=1894">http://ompf2.com/viewtopic.php?f=6&t=1894</a></p>
<p>If so, it was mpeterson who claimed to have an order-of-magnitude faster method, not Bikker. And mpeterson was very vague and not forthcoming about it.</p>
<p>Bikker said that his own method is about 20% faster than existing methods, which is consistent with the results presented in the paper.</p>
<p>--Nathan</p>
<div class="gmail_quote">On Mar 28, 2014 4:02 PM, "Matthew Heimlich" <<a href="mailto:matt.heimlich@gmail.com">matt.heimlich@gmail.com</a>> wrote:<br type="attribution"><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
Indeed, it doesn't appear to be an order of magnitude to me either,<br>
but that's a quote from Bikker himself over on Ompf. Might be worth<br>
clarifying with him.<br>
<br>
On Fri, Mar 28, 2014 at 6:44 PM, Brecht Van Lommel<br>
<<a href="mailto:brechtvanlommel@pandora.be">brechtvanlommel@pandora.be</a>> wrote:<br>
> Thanks for the links.<br>
><br>
> The stackless BVH doesn't seem so interesting at the moment, because<br>
> it's slower on both the CPU and GPU. Maybe it's more for raytracing<br>
> hardware.<br>
><br>
> The other paper shows about 20% faster raytracing for first bounce<br>
> rays, which is neat and it's interesting that it apparently makes this<br>
> kind of batching / ray ordering method consistently faster, whereas<br>
> previously it was more hit and miss. I wouldn't call it an order of<br>
> magnitude faster though, unless I'm missing something.<br>
><br>
> Brecht.<br>
><br>
> On Tue, Mar 25, 2014 at 3:51 PM, Matthew Heimlich<br>
> <<a href="mailto:matt.heimlich@gmail.com">matt.heimlich@gmail.com</a>> wrote:<br>
>> Thought I'd toss a couple of interesting BVH papers I'd found recently<br>
>> onto the mailing list. One is a stackless MBVH method that promises<br>
>> nice memory savings on the GPU, the other is a paper for CPU path<br>
>> tracing by Jacco Bikker which he claims can be an order of magnitude<br>
>> faster than the previous state-of-the-art algorithms. Bikker is the<br>
>> mind behind Arauna/Brigade for those who don't know. When he speaks up<br>
>> about BVH speed, I tend to take it seriously!<br>
>><br>
>> Anyway, thought they'd be interesting to some folks on here.<br>
>><br>
>> Cheers!<br>
>><br>
>> <a href="http://cg.iit.bme.hu/~afra/publications/afra2013cgf_mbvhsl.pdf" target="_blank">http://cg.iit.bme.hu/~afra/publications/afra2013cgf_mbvhsl.pdf</a><br>
>><br>
>> <a href="http://arauna2.ompf2.com/files/cgf_article.pdf" target="_blank">http://arauna2.ompf2.com/files/cgf_article.pdf</a><br>
>> _______________________________________________<br>
>> Bf-cycles mailing list<br>
>> <a href="mailto:Bf-cycles@blender.org">Bf-cycles@blender.org</a><br>
>> <a href="http://lists.blender.org/mailman/listinfo/bf-cycles" target="_blank">http://lists.blender.org/mailman/listinfo/bf-cycles</a><br>
> _______________________________________________<br>
> Bf-cycles mailing list<br>
> <a href="mailto:Bf-cycles@blender.org">Bf-cycles@blender.org</a><br>
> <a href="http://lists.blender.org/mailman/listinfo/bf-cycles" target="_blank">http://lists.blender.org/mailman/listinfo/bf-cycles</a><br>
_______________________________________________<br>
Bf-cycles mailing list<br>
<a href="mailto:Bf-cycles@blender.org">Bf-cycles@blender.org</a><br>
<a href="http://lists.blender.org/mailman/listinfo/bf-cycles" target="_blank">http://lists.blender.org/mailman/listinfo/bf-cycles</a><br>
</blockquote></div>