On building fast kd-Trees for Ray Tracing, and on doing that in O(N log N)
By I. Wald, Vlastimil Havran. 2006 IEEE Symposium on Interactive Ray Tracing, 2006
420 citations recorded by the source corpus.
Subfields: Computational Mechanics, Computer Graphics and Computer-Aided Design
View Paper: https://www.semanticscholar.org/paper/4c189a378a5b6f625507e9a76989cc6b9a5fc1e0
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Mechanics
- Kun Zhou
- Rui Wang
- Baining Guo
- Magdy F. Iskander
- Zhengqing Yun
- Qiming Hou
- Olga Sorkine-Hornung
- Christian Theobalt
In Computer Graphics and Computer-Aided Design
Citations in the corpus
- Ray Tracing for Radio Propagation Modeling: Principles and Applications (2015, background): “This is also a well studied topic in computer graphics for ray tracing [70], [71].”
- Real-time KD-tree construction on graphics hardware (2008, methodology): “For large nodes at upper tree levels, we use two simple and inexpensive heuristics, median splitting and " empty space maximizing " [Havran 2001; Wald and Havran 2006], to estimate the costs.”