search

dilevin / computer-graphics-bounding-volume-hierarchy

Computer Graphics Assignment about Bounding Volume Hierarchies
6 stars 5 forks source link

Brute force triangle intersect quick question #56

Closed NPTP closed 4 years ago

NPTP commented 4 years ago

Hi,

I'm debugging and just want to be sure that the brute force algorithm that my tree-based algorithm is being compared against is returning the right things to be compared against!

In ray_intersect_triangle_mesh_brute_force.cpp, we have hit_f which is the "index into F of triangle that was hit". Should hit_f be the index of the ROW of F, or should it be a more literal index (e.g. row * 3) ?

Thanks!

honglin-c commented 4 years ago

The index of the row of F.

NPTP commented 4 years ago

Thank you!