Ray shooting algorithms and data structures for Computer graphics (colloquy cycle)

Ray shooting is one of the most important problems for computer graphics. The efficiency of the algorithms for ray shooting has great impact on the performance of many global illumination algorithms. In this talk we give a short survey to various methods developed for ray shooting from the perspective of computational geometry and computer graphics. Particularly, we will focus on the concepts of orthogonal Kd-trees more often referred to as BSP trees in computer graphics. Recent developments in ray shooting will be discussed.