2 search results - page 1 / 1 » Parallel SAH k-D tree construction |
126
Voted
EGH
2010
Springer
14 years 10 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...
137
Voted
EGH
2011
Springer
14 years 17 hour ago
2011
Springer
A recently developed algorithm called Hierachical Linear Bounding Volume Hierarchies (HLBVH) has demonstrated the feasibility of reconstructing the spatial index needed for ray tr...