RT Journal Article
JF IEEE Transactions on Visualization & Computer Graphics
YR 2009
VO 16
SP 434
TI Yet Faster Ray-Triangle Intersection (Using SSE4)
A1 Adam Herout,
A1 Jiří Havel,
K1 Ray tracing
K1 geometric algorithms.
AB Ray-triangle intersection is an important algorithm, not only in the field of realistic rendering (based on ray tracing) but also in physics simulation, collision detection, modeling, etc. Obviously, the speed of this well-defined algorithm's implementations is important because calls to such a routine are numerous in rendering and simulation applications. Contemporary fast intersection algorithms, which use SIMD instructions, focus on the intersection of ray packets against triangles. For intersection between single rays and triangles, operations such as horizontal addition or dot product are required. The SSE4 instruction set adds the dot product instruction which can be used for this purpose. This paper presents a new modification of the fast ray-triangle intersection algorithms commonly used, which—when implemented on SSE4—outperforms the current state-of-the-art algorithms. It also allows both a single ray and ray packet intersection calculation with the same precomputed data. The speed gain measurements are described and discussed in the paper.
PB IEEE Computer Society, [URL:http://www.computer.org]
SN 1077-2626
LA English
DO 10.1109/TVCG.2009.73
LK http://doi.ieeecomputersociety.org/10.1109/TVCG.2009.73