Sciweavers

Share
9 search results - page 2 / 2
» Cost-Optimal Trees for Ray Shooting
Sort
View
RT
2001
Springer
12 years 2 months ago
Realistic Reflections and Refractions on Graphics Hardware with Hybrid Rendering and Layered Environment Maps
We introduce hybrid rendering, a scheme that dynamically ray traces the local geometry of reflective and refractive objects, but approximates more distant geometry by hardwaresupp...
Ziyad S. Hakura, John M. Snyder
ISVC
2007
Springer
12 years 4 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 depend...
Sajid Hussain, Håkan Grahn
EGH
2010
Springer
11 years 7 months ago
Parallel SAH k-D tree construction
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
Byn Choi, Rakesh Komuravelli, Victor Lu, Hyojin Su...
COMPGEOM
2010
ACM
12 years 2 months ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan
books