Geek Answers Handbook

Is a Möller-Trambor ray intersection better?

For a ray tracing project, I studied algorithms regarding detecting the intersection of rays and triangles (defined by three vertices). What I have found so far is that the Möller-Trumbore (MT) algorithm is used universally.

So my questions are: 1) Are there alternatives to MT or an algorithm that is considered the fastest way to calculate intersections? 2) If so, is it proven that MT is optimal or can someone invent an even faster algorithm?

Edit : now I see that my question is very similar to the intersection of the rays of a triangle

+6
source share
2 answers

There is a document from 2016 in which the authors claim that

Working under ideal experimental conditions, our algorithm is always faster than the standard Möller and Trumbore algorithm, and faster than the highly tuned modern version, except for very high beam-triangle.

Source: Doug Baldwin and Michael Weber, Rapid Intersections of Triangle Rays in Coordinate Transformation, Journal of Computer Graphics Methods (JCGT), vol. 5, no. 3, 39-49, 2016

Available online http://jcgt.org/published/0005/03/03/

+5
source

Be careful with Weber's algorithm. Although this may be faster, I see a large number of intersections erroneously defined as non-intersecting. The document says:

, t b1 , .

2-3% , "" . , , P , , 't'.

, MT, epsilon .

+4

More articles:


All Articles