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

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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computer graphics forum Jg. 35; H. 8; S. 68 - 79
Hauptverfasser:	Vinkler, Marek, Havran, Vlastimil, Bittner, Jiří
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Oxford Blackwell Publishing Ltd 01.12.2016
Schlagworte:	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
ISSN:	0167-7055, 1467-8659
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!