IMPROVING RAY TRAVERSAL BY USING SEVERAL SPECIALIZED KD-TREES

Roberto Torres, Pedro J. Martín, Antonio Gavilanes, Luis F. Ayuso

Abstract

In this paper, we present several variants of the Surface Area Heuristics (SAH) to build kd-trees for specific sets of rays’ directions. In order to cover the whole space of directions, several sets of directions are considered and each of them leads to a different specialized kd-tree. We call Multi-kd-tree to the set of these kd-trees. During rendering, each ray will traverse the kd-tree associated with the set containing its direction. In order to evaluate the efficiency of our proposal, we have implemented a Path Tracing and an Ambient Occlusion renderer on GPU with CUDA. A SAH-based kd-tree has been compared to a Multi-kd-tree and we show that all the new heuristics exhibit a better performance than SAH over usual scenes.

References

  1. Aila, T. and Laine, S. (2009). Understanding the Efficiency of Ray Traversal on GPUs. In High-Performance Graphics 2009, pages 145-149.
  2. Bittner, J. and Havran, V. (2009). RDH: Ray Distribution Heuristics for Construction of Spatial Data Structures. In SCCG 2009, pages 61-67, Budmerice, Slovakia.
  3. Fabianowski, B., Flower, C., and Dingliana, J. (2009). A Cost Metric for Scene-Interior Ray Origins. In Eurographics 2009 Short Papers, pages 49-52.
  4. Foley, T. and Sugerman, J. (2005). KD-Tree Acceleration Structures for a GPU Raytracer. In Graphics Hardware 2005, pages 15-22.
  5. Garanzha, K. and Loop, C. (2010). Fast Ray Sorting and Breadth-First Packet Traversal for GPU Ray Tracing. In Eurographics 2010.
  6. Goldsmith, J. and Salmon, J. (1987). Automatic creation of object hierarchies for ray tracing. IEEE Computer Graphics and Application, 7(5):14-20.
  7. Günther, J., Popov, S., Seidel, H.-P., and Slusallek, P. (2007). Realtime Ray Tracing on GPU with BVHbased Packet Traversal. In Eurographics Symposium on Interactive Ray Tracing 2007, pages 113-118.
  8. Harris, M., Owens, J. D., Sengupta, S., Tseng, S., Zhang, Y., Davidson, A., and Satish, N. (2010). CUDA Data Parallel Primitives Library (CUDPP 1.1.1). http://code.google.com/p/cudpp/.
  9. Havran, V. (2000). Heuristic Ray Shooting Algorithms. Ph.d. thesis, Faculty of Electrical Engineering, Czech Technical University in Prague.
  10. Havran, V. and Bittner, J. (1999). Rectilinear Trees for Preferred Ray Sets. In SCCG 1999, pages 171-178, Budmerice, Slovakia.
  11. Horn, D. R., Sugerman, J., Mike, H., and Hanrahan, P. (2007). Interactive KD-Tree GPU Raytracing. In I3D 2007, pages 167-174.
  12. Hunt, W. and Mark, W. R. (2008). Adaptive Acceleration Structures in Perspective Space. In IEEE Symposium on Interactive Ray Tracing, pages 11-17.
  13. MacDonald, D. J. and Booth, K. S. (1990). Heuristics for ray tracing using space subdivision. Visual Computer, 6(3):153-166.
  14. Pharr, M. and Humphreys, G. (2010). Physically Based Rendering: From Theory to Implementation (second edition). Morgan Kaufmann.
  15. Popov, S., Günther, J., Seidel, H.-P., and Slusallek, P. (2007). Stackless KD-tree traversal for high performance GPU ray tracing. Computer Graphics Forum (Proceedings of Eurographics), 26(3):415-424.
  16. Thrane, N., Simonsen, L. O., and Orbaek, A. P. (2005). A Comparison of Acceleration Structures for GPU Assisted Ray Tracing. Technical report, University of Aarhus.
  17. Torres, R., Martin, P. J., and Gavilanes, A. (2011). Traversing a BVH Cut to Exploit Ray Coherence. In GRAPP 2011, pages 140-150.
  18. Torres, R., Martín, P. J., and Gavilanes, A. (2009). Ray casting using a roped BVH with CUDA. In Proc. Spring Conference on Computer Graphics, pages 107 - 114.
  19. Wald, I. (2007). On Fast Construction of SAH-Based Bounding Volume Hierarchies. In Symposium on Interactive Ray Tracing 2007, pages 33-40.
  20. Wald, I. and Havran, V. (2006). On Building Fast KD-Trees for Ray Tracing, and on Doing That in O(NlogN). In Symposium on Interactive Ray Tracing, pages 61-69.
Download


Paper Citation


in Harvard Style

Torres R., J. Martín P., Gavilanes A. and F. Ayuso L. (2012). IMPROVING RAY TRAVERSAL BY USING SEVERAL SPECIALIZED KD-TREES . In Proceedings of the International Conference on Computer Graphics Theory and Applications and International Conference on Information Visualization Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2012) ISBN 978-989-8565-02-0, pages 215-226. DOI: 10.5220/0003844702150226


in Bibtex Style

@conference{grapp12,
author={Roberto Torres and Pedro J. Martín and Antonio Gavilanes and Luis F. Ayuso},
title={IMPROVING RAY TRAVERSAL BY USING SEVERAL SPECIALIZED KD-TREES},
booktitle={Proceedings of the International Conference on Computer Graphics Theory and Applications and International Conference on Information Visualization Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2012)},
year={2012},
pages={215-226},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003844702150226},
isbn={978-989-8565-02-0},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Computer Graphics Theory and Applications and International Conference on Information Visualization Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2012)
TI - IMPROVING RAY TRAVERSAL BY USING SEVERAL SPECIALIZED KD-TREES
SN - 978-989-8565-02-0
AU - Torres R.
AU - J. Martín P.
AU - Gavilanes A.
AU - F. Ayuso L.
PY - 2012
SP - 215
EP - 226
DO - 10.5220/0003844702150226