Research on Ray Tracing Algorithm and Acceleration Techniques using KD-tree

In the field of computer graphics, ray tracing algorithm is a kind of algorithm that can realize global illumination. Using the parallel computing power of GPU to accelerate ray tracing is one of the research hotpots at present. Based on the principle of ray tracing, this paper focuses on analyzing the two major problems of ray tracing algorithm acceleration research. One is the data structure problem, the other is the implementation of traversal algorithm on GPU. Based on the summary of the existing research, this paper discusses the derivation of the intersection of ray and surface element, compares various data structures, and analyzes the traversal algorithm based on KD-tree on GPU.