Sciweavers

Share
ISVC
2007
Springer

Fast kd -Tree Construction for 3D-Rendering Algorithms Like Ray Tracing

9 years 9 months ago
Fast kd -Tree Construction for 3D-Rendering Algorithms Like Ray Tracing
Many computer graphics rendering algorithms and techniques use ray tracing for generation of natural and photo-realistic images. The efficiency of the ray tracing algorithms depends, among other techniques, upon the data structures used in the background. kd-trees are some of the most commonly used data structures for accelerating ray tracing algorithms. Data structures using cost optimization techniques based upon Surface Area Heuristics (SAH) are generally considered to be best and of high quality. During the last decade, the trend has been moved from off-line rendering towards real time rendering with
Sajid Hussain, Håkan Grahn
Added 08 Jun 2010
Updated 08 Jun 2010
Type Conference
Year 2007
Where ISVC
Authors Sajid Hussain, Håkan Grahn
Comments (0)
books