A study of restricted BSP trees for ray tracing

IEEE/ EG Symposium on Interactive Ray Tracing 2007 Proceedings, IRT

Volumn , Issue , 2007, Pages 55-62

  Kammaje, Ravi P ^a   Mora, Benjamin ^a  

^a SWANSEA UNIVERSITY   (United Kingdom)

Author keywords

I.3.6 computer graphics : Methodology and techniques graphics data structures and data types

Indexed keywords

BINARY SPACE PARTITIONING (BSP) TREES; BSP TREES; INTERACTIVE RAY TRACING; TREE CONSTRUCTION;

ELEMENTARY PARTICLE SOURCES; LEARNING SYSTEMS; PARTITIONS (BUILDING);

RAY TRACING;

EID: 47249119687     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RT.2007.4342591     Document Type: Conference Paper

References (22)

1. Evenly distributed points on sphere. available at "http://www. cgafaq.info/wiki/Evenly_distributed_points_on_sphere".
2. A. Y. Chang. A survey of geometric data structures for ray tracing. Technical report, Polytechnic University, Brooklyn, Long Island, Westchester., 2001.
3. H. Fuchs, Z. M. Kedem, and B. F. Naylor. On visible surface generation by a priori tree structures. Computer Graphics, (Proceedings of SIGGRAPH 1980), pages 124-133, 1980.
4. D. S. Fussell and K. R. Subramanian. Fast ray tracing using Kd-trees. Technical Report CS-TR-88-07, The University of Texas at Austin, Jan. 1988.
5. D. Gordon and S. Chen. Front-to-back display of BSP trees. IEEE Comput. Graph. Appl., 11(5):79-85, 1991.
6. V. Havran. Heuristic Ray Shooting Algorithms. PhD thesis, Czech Technical University in Prague, Czech Republic, 2001.
7. V. Havran and J. Bittner. On improving Kd-trees for ray shooting. In Proceedings of WSCG, pages 209-216, 2002., 2002.
8. V. Havran, J. Prikryl, and W. Purgathofer. Statistical comparison of ray-shooting efficiency schemes. Technical report, Vienna University of Technology., 2000.
9. T. L. Kay and J. T. Kajiya. Ray tracing complex scenes. Computer Graphics, (Proceedings of SIGGRAPH 1986), 20(4):269-278, 1986.
10. J. T. Klosowski, M. Held, J. S. B. Mitchell, H. Sowizral, and K. Zikan. Efficient collision detection using bounding volume hierarchies of k-DOPs. IEEE Transactions on Visualization and Computer Graphics, 4(1):21-36, Mar. 1998.
11. D. J. MacDonald and K. S. Booth. Heuristics for ray tracing using space subdivision. Vis. Comput., 6(3): 153-166, 1990.
12. A. Reshetov, A. Soupikov. and J. Hurley. Multi-level ray tracing algorithm. ACM Transactions on Graphics (Proceedings of SIGGRAPH 2005), 24(3): 1176-1185, 2005.
13. R.J.Segura and F.R.Feito. Algorithms to test ray-triangle intersection. In Proceedings of WSCG., 2001.
14. S. M. Rubin and T. Whitted. A 3-dimensional representation for fast rendering of complex scenes. Computer Graphics, (Proceedings of SIGGRAPH 1980), pages 110-116, 1980.
15. G. Stoll. Introduction to real-time ray tracing, part ii: Achieving real time - optimization techniques. Course on Interactive Ray Tracing, (SIGGRAPH 2005), 2005.
16. K. Sung and P. Shirley. Ray tracing with the BSP tree. Graphics Gems 111, pages 271-274, 1992.
17. I. E. Sutherland and G. W. Hodgman. Reentrant polygon clipping. Commun. ACM, 17(1):32-42, 1974.
18. I. Wald. Realtime Ray Tracing and Interactive Global Illumination. PhD thesis, Computer Graphics Group, Saarland University, 2004.
19. I. Wald and V. Havran. On building fast Kd-trees for ray tracing, and on doing that in O(N log N). In Proceedings of 2006 IEEE Symposium on Interactive Ray Tracing, Sept. 2001.
20. I. Wald, P. Slusallek, C. Benthin, and M. Wagner. Interactive rendering with coherent ray tracing. Computer Graphics Forum (Proceedings of Eurographics 2001), 20(3):153-164, 2001.
21. H. Weghorst. G. Hooper, and D. P. Greenberg. Improved computational methods for ray tracing. ACM Trans. Graph., 3(1):52-69, 1984.
22. T. Whitted. An improved illumination model for shaded display. Commun. ACM, 23(6):343-349, 1980.