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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Computer graphics forum Ročník 35; číslo 8; s. 68 - 79
Hlavní autori:	Vinkler, Marek, Havran, Vlastimil, Bittner, Jiří
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Oxford Blackwell Publishing Ltd 01.12.2016
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!