Yet faster ray-triangle intersection (using SSE4)
Related Experiment Video
Updated: Jun 15, 2026

Serial Block-Face Scanning Electron Microscopy (SBF-SEM) of Biological Tissue Samples
Published on: March 26, 2021
1Brno University of Technology, Brno, Czech Republic. ihavel@fit.vutbr.cz
Abstract:
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.
More Related Videos
Related Concept Videos
The Law of Sines
Scalar and Vector Triple Products
The scalar triple product is the dot product of a vector with the cross product of two vectors.
Design Example: Traverse Angle Computations
Divergence Theorem in 3D Space
Trapezoidal Rule
Parallel-axis Theorem

