Lecture 9: Intro to Ray-Tracing & Accelerating Ray-Scene Intersection (22)
kkkhanl
I'm not sure about the details, but I find it interesting that coefficients in both the ray equation and the barycentric coordinates are used to complete the calculation.
LeslieTrue
It's a cool idea that has similar style to Strassen algorithm in matrix multiplication. During my search for similar algorithms, I didn't find some elegant blogs that describe this methods but I did find some other methods, i.e. https://tavianator.com/2014/ray_triangle.html.
I hope there will be more better methods described in latter lectures.
akhilvemuri
In summary, the Möller–Trumbore algorithm works by first calculating the normal vector of the triangle plane and then determining if the ray intersects with the plane. If the ray does intersect with the plane, the algorithm checks whether the intersection point is inside the triangle by testing whether it lies within the three edges of the triangle. This can also be further optimized by using SIMD or GPU acceleration.
I'm not sure about the details, but I find it interesting that coefficients in both the ray equation and the barycentric coordinates are used to complete the calculation.
It's a cool idea that has similar style to Strassen algorithm in matrix multiplication. During my search for similar algorithms, I didn't find some elegant blogs that describe this methods but I did find some other methods, i.e. https://tavianator.com/2014/ray_triangle.html.
I hope there will be more better methods described in latter lectures.
In summary, the Möller–Trumbore algorithm works by first calculating the normal vector of the triangle plane and then determining if the ray intersects with the plane. If the ray does intersect with the plane, the algorithm checks whether the intersection point is inside the triangle by testing whether it lies within the three edges of the triangle. This can also be further optimized by using SIMD or GPU acceleration.