2018
DOI: 10.12783/dtcse/amms2018/26216
|View full text |Cite
|
Sign up to set email alerts
|

Ray Tracing Dynamic Scenes Using Multiple Kd-trees

Abstract: With faster hardware and algorithmic improvements, real-time ray tracing is finally within reach. A variety of different data structures have been developed for ray tracing over the past decades. These spatial data structures crucial for fast ray tracing must be rebuilt or updated as the scene changes, and this can become a bottle-neck for the speed of ray tracing. In this paper, a novel algorithm is proposed to improve the rendering speed for static and moving objects by build kd-trees respectively, i.e., we … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 8 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?