9 search results - page 2 / 2 » Cost-Optimal Trees for Ray Shooting |
RT
2001
Springer
13 years 9 months ago
2001
Springer
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...
ISVC
2007
Springer
13 years 10 months ago
2007
Springer
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...
EGH
2010
Springer
13 years 2 months ago
2010
Springer
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...
COMPGEOM
2010
ACM
13 years 9 months ago
2010
ACM
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...