refitOnCpu for a tree whose primitives are its own 48-byte triangle
records (triangleFloats, in tree order): each leaf's box is the min and
max of its records' corners, read in place, with no primitive-box array in
between. The result is refitOnCpu's with boxes made from the same corners
(unions of f32 values are exact). CpuMeshBvh.refit gives the same boxes
from one pass that also writes the records (its refitTreeFromSource).
refitOnCpu for a tree whose primitives are its own 48-byte triangle records (
triangleFloats, in tree order): each leaf's box is the min and max of its records' corners, read in place, with no primitive-box array in between. The result is refitOnCpu's with boxes made from the same corners (unions of f32 values are exact).CpuMeshBvh.refitgives the same boxes from one pass that also writes the records (itsrefitTreeFromSource).