Abstract:

This paper shows an overview to the todays generally accepted opinion data structures for ray tracing (grid, kd-tree and bvh) with attention to kd-trees. Furthermore the possibilities to schedule the kd-tree construction algorithms on graphical processing units (GPU) are discussed. Additionally, real time ability is shown for a recently published kd-tree construction method. Finally previous implementation of GPU and CPU ray tracer using kd-trees as data structures are compared.