in radiative heat transfer or in collision detection, it is useful/necessary to be able to do the intersection of a ray with a mesh.
To do that efficiently we need to adapt our kdtree data structure
The kdtree would hold a large set of points which would be nodes of a mesh. We wish to compute the intersection efficiently and know the set of faces with which the ray intersects the mesh