Closed Tyler799 closed 4 years ago
1: Is multiplying by the inverse of the determinant somehow a way to convert from barycentric to Cartesian?
No
2: In the paper they have these "U, V, W" at the end. Is the idea that at the end of the algorithm, they leave the intersection point in barycentric form, rather than in Cartesian? If that's the case, what is happening at the end of NanoRT? What do u and v represent? And why is W not calculated?
3: If I want to know if I have an edge hit on a triangle, how do I tell?
You can use your own intersector and intersection struct by template.
See curves_primitive
for example: https://github.com/lighttransport/nanort/tree/master/examples/curves_primitive
I noticed that in the original paper, the following is done:
But in NanoRT, the following is done:
I am attempting to implement the algorithm from the paper myself, but am having some trouble understanding a few things.
1: Is multiplying by the inverse of the determinant somehow a way to convert from barycentric to Cartesian?
2: In the paper they have these "U, V, W" at the end. Is the idea that at the end of the algorithm, they leave the intersection point in barycentric form, rather than in Cartesian? If that's the case, what is happening at the end of NanoRT? What do u and v represent? And why is W not calculated?
3: If I want to know if I have an edge hit on a triangle, how do I tell?