i just read thru chapter 5 and found the idea of grouping triangles into more

complex stripes “expanding” and very useful to speed up of ray/triangle intersections.

is there also an optimized quad/line intersection available for double-sided quads ? a

simple halfspace test at the front will not work here to seperate the tris. ]]>

ricardoquesada, you can e.g. normalize the floats so they are in the same exponent range with the same sign, at which point only the fraction bits of the floats need to be considered (of which there are 23 bits plus one implicit bit which is always 1). Pick the top N bits of the fraction bits, and store those in your key.

]]>I have a question regarding the depth key.

I have all the depth values in floats, and I want to use those values in the key.

What is the best way to encode floats into ‘bits’ (or integer) so that I can use it as part of the key ?

Thanks!

]]>