Comparação de estruturas de dados para aceleração em path tracing

Abstract

The search for advanced rendering methods capable of simulating light interaction with the environment in a realistic manner has been a constant in the evolution of computer graphics. Despite the challenges posed by its computational complexity, path tracing emerges as a promising technique. In this context, this work focuses on the comparative analysis between the data structures Bounding Volume Hierarchy (BVH) and K-dimensional tree (Kd-tree), applied specifically to path tracing, focusing on how these structures impact the efficiency of real-time rendering. The conducted research evaluates the advantages and disadvantages of each approach on NVIDIA GeForce RTX graphics cards. Through practical tests and performance analysis, the study provided an understanding of the advantages and disadvantages of each structure, contributing to the optimization of the path tracing process in computer graphics applications.