Idioma:

Performance Comparison of Bounding Volume Hierarchies and Kd-Trees for GPU Ray Tracing

Vinkler, Marek ; Havran, Vlastimil ; Bittner, Jiří

Computer graphics forum, 2016-12, Vol.35 (8), p.68-79 [Periódico revisado por pares]

Oxford: Blackwell Publishing Ltd

Texto completo disponível

Citações Citado por

Enviar para

Título:
Performance Comparison of Bounding Volume Hierarchies and Kd-Trees for GPU Ray Tracing
Autor: Vinkler, Marek ; Havran, Vlastimil ; Bittner, Jiří
Assuntos: Analysis ; Architecture ; Central processing units ; Computer architecture ; CPUs ; Criteria ; Data structures ; GPU ; Hierarchies ; I.3.1 [Computer Graphics]: Hardware architecture-Parallel processing ; I.3.6 [Computer Graphics]: Methodology and Techniques-Graphics data structures and data types ; I.3.7 [Computational Graphics]: Three-Dimensional Graphics and Realism-Raytracing ; I.3.7 [Computational Graphics]: Three‐Dimensional Graphics and Realism—Raytracing; I.3.6 [Computer Graphics]: Methodology and Techniques—Graphics data structures and data types; I.3.1 [Computer Graphics]: Hardware architecture—Parallel processing ; Image processing systems ; object-partitioning ; Parallel processing ; Performance assessment ; performance comparison ; Profiling ; Ray tracing ; Rendering ; space-partitioning ; Studies
É parte de: Computer graphics forum, 2016-12, Vol.35 (8), p.68-79
Notas: Czech Science Foundation - No. P202/12/2413
istex:85253D7BFC778759A349878547366788F4849F95
ark:/67375/WNG-6M1HG181-3
ArticleID:CGF12776
Czech Technical University in Prague - No. SGS13/214/OHK3/3T/13
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
Descrição: We present a performance comparison of bounding volume hierarchies and kd‐trees for ray tracing on many‐core architectures (GPUs). The comparison is focused on rendering times and traversal characteristics on the GPU using data structures that were optimized for very high performance of tracing rays. To achieve low rendering times, we extensively examine the constants used in termination criteria for the two data structures. We show that for a contemporary GPU architecture (NVIDIA Kepler) bounding volume hierarchies have higher ray tracing performance than kd‐trees for simple and moderately complex scenes. On the other hand, kd‐trees have higher performance for complex scenes, in particular for those with high depth complexity. Finally, we analyse the causes of the performance discrepancies using the profiling characteristics of the ray tracing kernels. We present a performance comparison of bounding volume hierarchies and kd‐trees for ray tracing on many‐core architectures (GPUs). The comparison is focused on rendering times and traversal characteristics on the GPU using data structures that were optimized for very high performance of tracing rays. To achieve low rendering times, we extensively examine the constants used in termination criteria for the two data structures. We show that for a contemporary GPU architecture (NVIDIA Kepler) bounding volume hierarchies have higher ray tracing performance than kd‐trees for simple and moderately complex scenes.
Editor: Oxford: Blackwell Publishing Ltd
Idioma: Inglês

Voltar para lista de resultados

Realização: Logos de Redes Sociais:

Performance Comparison of Bounding Volume Hierarchies and Kd-Trees for GPU Ray Tracing

Vinkler, Marek ; Havran, Vlastimil ; Bittner, Jiří

Oxford: Blackwell Publishing Ltd

Buscando em bases de dados remotas. Favor aguardar.