Highly Parallel Fast KD‐tree Construction for Interactive Ray Tracing of Dynamic Scenes

Abstract

Figure 1: Dynamic scenes ray traced using parallel fast construction of kd-tree. The scenes were rendered with shadows, 1 reflection (except HAND) and textures at 512x512 resolution on a 2-way Intel R Core TM 2 Duo machine. a) HAND -a static model of a man with a dynamic hand; 47K static and 8K dynamic triangles; 2 lights; 46.5 FPS. b) GOBLIN -a static model of a hall with a dynamic model of a goblin; 297K static and 153K dynamic triangles; 2 lights; 9.2 FPS. c) BAR -a static model of bar Carta Blanca with a dynamic model of a man; 239K static and 53K dynamic triangles; 2 lights; 12.6 FPS. d) OPERA TEAM -a static model of an opera house with a dynamic model of 21 men without instancing; 78K static and 1105K dynamic triangles; 4 lights; 2.0 FPS. AbstractWe present a highly parallel, linearly scalable technique of kd-tree construction for ray tracing of dynamic geometry. We use conventional kd-tree compatible with the high performing algorithms such as MLRTA or frustum tracing. Proposed technique offers exceptional construction speed maintaining reasonable kd-tree quality for rendering stage. The algorithm builds a kd-tree from scratch each frame, thus prior knowledge of motion/deformation or motion constraints are not required. We achieve nearly real-time performance of 7-12 FPS for models with 200K of dynamic triangles at 1024x1024 resolution with shadows and textures.

Hierarchical octree andk-d tree grids for 3D radiative transfer simulations

“…Nowadays they are the most popular space partitioning structure in computer graphics applications (e.g. MacDonald & Booth 1990;Havran 2000;Reshetov et al 2005;Wald & Havran 2006;Shevtsov et al 2007;Zhou et al 2008). To the best of our knowledge, k-d trees have not been used in the context of astrophysical radiative transfer simulations.…”

Reducing Render Time in Ray Tracing by Pixel Averaging

“…There are three sections in Table 3. Each section was tested for different k (10,20,30). This table shows pixel differential method is better than the pixel averaging method for equal k. differences are very small.…”

“…To get more details on kd-tree construction and its algorithm is suitable to refer to [10]. They introduced an algorithm based on ordering algorithm using O(nlogn).…”

“…Shevtson [10] has introduced an algorithm called min-max binning. This algorithm pierces the scene and prepares the cutting surface for evaluating the least cost function of the kd-tree consequently.…”

Ray Casting Deformable Models on the GPU

“…al. [14] ray trace dynamic models using a parallel and linearly scalable technique of kd-tree construction. They achieve 7 to 12 FPS for models with up to 200K triangles at a window resolution of 1024 × 1024.…”