This part is not covered in lecture yet but I was wondering is there a performance difference between K-D tree and BVH? Is K-D tree faster since it can terminate early.

@mapqh, hmm I think this is an interesting question. I think the performance could largely due to "luck" associated with the distribution of the underlying distribution of the geometric primitives in the scene. To me it completely possible that different arrangements of the same objects can lead to completely different (wall) runtimes depending on where/how I place the objects.