Implementação em OpenCL— e Analise Comparativa de Três Algoritmos de Interseção Raio-Triangulo em FPGA

Abstract

The calculation of ray-triangle intersections represents nearly 85% of the compu tational cost of rendering methods based in ray tracing. This monograph introduces a hardware implementation and a comparative study of three algorithms to determine ray-triangle intersection for FPGA: Moller-Trumbore, Ingo Wald and Hanika algorithms. To reduce the size of the synthesized circuits, we proposed xed point implementations of Moller-Trumbore and Ingo Wald algorithms, originally developed under oating point representation. We compare these implementations against Hanikas algorithm, which uses the xed point representation by default. To accelerate the design of the digital hardware and synthesize the kernel code in high-level, we resorted to the OpenCL— framework. The results reported comprise: execution times on FPGA, CPU and GPU; comparison between rendered images and the statistics of synthesized designs.