6 search results - page 1 / 2 » Highly Parallel Fast KD-tree Construction for Interactive Ra... |
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...
CG
2008
Springer
13 years 4 months ago
2008
Springer
Recent developments have produced several techniques for interactive ray tracing of dynamic scenes. In particular, bounding volume hierarchies (BVHs) are efficient acceleration st...
CGF
2011
12 years 8 months ago
2011
We investigate the use of two-level nested grids as acceleration structure for ray tracing of dynamic scenes. We propose a massively parallel, sort-based construction algorithm an...
TOG
2008
13 years 4 months ago
2008
We present an algorithm for constructing kd-trees on GPUs. This algorithm achieves real-time performance by exploiting the GPU's streaming architecture at all stages of kd-tr...