d4ceade5eadea48aaab8e2bbf462ba996dab5fa6
the code snippet is supposed to compute the maximal `isect.t` in the array, which is used to determine if subsequent intersections should be added. However, the previous implementation includes the old `isect.t` which is going to be replaced, resulting an overestimation of `tmax_hits` and thus missing closer intersections. For BVH2, the issue is fixed by computing the `max_t` after a new entry is inserted. For Embree, the issue is fixed by finding the `second_largest_t` as well, and compare that with the new insertion to find the new `max_t`. Pull Request: https://projects.blender.org/blender/blender/pulls/125739
…
Blender
Blender is the free and open source 3D creation suite. It supports the entirety of the 3D pipeline-modeling, rigging, animation, simulation, rendering, compositing, motion tracking and video editing.
Project Pages
Development
License
Blender as a whole is licensed under the GNU General Public License, Version 3. Individual files may have a different, but compatible license.
See blender.org/about/license for details.
Description
Languages
C++
78%
Python
14.9%
C
2.9%
GLSL
1.9%
CMake
1.2%
Other
0.9%
