Avancerad sökning

Hittade 1 uppsats som matchar ovanstående sökkriterier.

1. 1. Massively Parallel BVH Construction Using Mini-trees

   Uppsats för yrkesexamina på avancerad nivå, Lunds universitet/Institutionen för datavetenskap

   Författare :Erik Nossborn; [2016]
   Nyckelord :BVH; computer graphics; GPU; CUDA; ray tracing; Technology and Engineering;

   Sammanfattning : The Bounding Volume Hierarchy is an acceleration data structure used in ray tracing, allowing for faster intersection tests between rays and triangles. The goal of this thesis was to take one algorithm for rapidly generating such data structures, the Bonsai algorithm, which was initially implemented on a CPU, and instead implement it on a graphics processing unit. LÄS MER