Razakhel / RaZ / 10750444449

74%

master: 74%

push

github

[Data/BoundingVolumeHierarchy] Querying a leaf returns directly

- It allows avoiding doing useless operations further, since we know it can't hit anything

- If the node is a leaf, the triangle is directly tested instead of first testing the AABB
  - Performance-wise, it presumably is either the same or marginally more efficient, as there's supposedly a high probability of hitting the triangle when reaching a leaf
  - The ray-AABB check can fill the hit structure with irrelevant data

5 of 5 new or added lines in 1 file covered. (100.0%)

8024 of 10095 relevant lines covered (79.48%)

2038.92 hits per line