Fast 3D Line Segment–Triangle Intersection Test
Nick Chirkov · Journal of Graphics Tools · 2005
I present a clean algorithm for determining if a line segment intersects a triangle in three dimensions. The algorithm performs a few binary tests that check if a point of intersection of the line segment and triangle plane is inside the triangle. Then I present some essential optimizations for this algorithm that reduce overall computation complexity. The algorithm does not compute an intersection point. The algorithm is comparable with others, but I believe it is the fastest one when additional memory storage is available.