In ray tracing with BVH, one can typically use either distance-based sorting or axis-based sorting for determining the traversal order of child nodes.
I tested both methods, it's observed that axis-based sorting is slightly faster than distance-based sorting, interesting. We only compare the number of primitive intersections that needs to be performed in both methods, we don't compare other factors like actual rendering time, traversal steps, or traversal costs. So, this should be a fair test on the algorithm aspect.
