Massively Parallel Hierarchical Scene Processing with Applications in Rendering

We present a novel method for massively parallel hierarchical scene processing on the GPU, which is based on sequential decomposition of the given hierarchical algorithm into small functional blocks. The computation is fully managed by the GPU using a specialized task pool which facilitates synchron...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computer graphics forum Jg. 32; H. 8; S. 13 - 25
Hauptverfasser: Vinkler, Marek, Bittner, Jiří, Havran, Vlastimil, Hapala, Michal
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Oxford Blackwell Publishing Ltd 01.12.2013
Schlagworte:
acceleration data structures
Algorithms
Analysis
BVH
Computer graphics
CUDA
I.3.6 [Computer Graphics]: Methodology and Techniques-Graphics data structures and data types
I.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism-Ray tracing
parallel algorithms
Parallel processing
ray tracing
Studies
ISSN:0167-7055, 1467-8659
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We present a novel method for massively parallel hierarchical scene processing on the GPU, which is based on sequential decomposition of the given hierarchical algorithm into small functional blocks. The computation is fully managed by the GPU using a specialized task pool which facilitates synchronization and communication of processing units. We present two applications of the proposed approach: construction of the bounding volume hierarchies and collision detection based on divide‐and‐conquer ray tracing. The results indicate that using our approach we achieve high utilization of the GPU even for complex hierarchical problems which pose a challenge for massive parallelization. The results indicate that using our approach we achieve high utilization of the GPU even for complex hierarchical problems which pose a challenge for massive parallelization. We present a novel method for massively parallel hierarchical scene processing on the GPU, which is based on sequential decomposition of the given hierarchical algorithm into small functional blocks. The computation is fully managed by the GPU using a specialized task pool which facilitates synchronization and communication of processing units. We present two applications of the proposed approach: construction of the bounding volume hierarchies and collision detection based on divide‐and‐conquer ray tracing
Bibliographie:Czech Science Foundation under research - No. P202/11/1883; No. P202/12/2413; No. P202/10/1435
ArticleID:CGF12140
istex:215A51C2E8518D6CF36B478BA24132939C68D9FB
ark:/67375/WNG-W9FX0X52-7
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0167-7055
1467-8659
DOI:10.1111/cgf.12140