Ray tracing deformable scenes using dynamic bounding volume hierarchies

420 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

OptiX: a general purpose ray tracing engine (2010, background): “While numerous high-level ray tracing libraries, engines and APIs have been proposed [Wald et al. 2007b], efforts to date have been focused on specific applications or classes of rendering algorithms, making them difficult to adapt to other domains or architectures.”
Real-time KD-tree construction on graphics hardware (2008, methodology): “One is an algorithm based on bounding volume hierarchies (BVHs) [Wald et al. 2007], and the other is the multi-core CPU algorithm using kd-trees [Shevtsov et al.”
Ray Tracing on the Cell Processor (2006, background): “Ray tracing is well-known to benefit from parallelism [17] [18], and most of the more recent ray tracing algorithms are already capable of exploiting SIMD operations [30] [21] [27] [28].”
On building fast kd-Trees for Ray Tracing, and on doing that in O(N log N) (2006, background): “We do not attempt fast rebuilds for interactive applications ([4, 21, 28, 12, 25].”