메뉴 건너뛰기




Volumn , Issue , 2007, Pages 41-46

Terminating spatial hierarchies by a priori bounding memory

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; ELEMENTARY PARTICLE SOURCES; FILE ORGANIZATION; HARDWARE;

EID: 47249127695     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RT.2007.4342589     Document Type: Conference Paper
Times cited : (8)

References (29)
  • 1
    • 0023379978 scopus 로고
    • Computer Graphics (Proc. SIGGRAPH 1987)
    • 55-64
    • J. Arvo and D. Kirk. Fast Ray Tracing by Ray Classification. Computer Graphics (Proc. SIGGRAPH 1987), 21(4):55-64, 1987.
    • (1987) , vol.21 , Issue.4
    • Arvo, J.1    Kirk, D.2
  • 3
    • 84989547063 scopus 로고
    • Computer Graphics Forum (Proc. Eurographics 1995)
    • 371-382
    • F. Cazals, G. Drettakis, and C. Puech. Filtering, Clustering and Hierarchy Construction: a New Solution for Ray-Tracing Complex Scenes. Computer Graphics Forum (Proc. Eurographics 1995), 14(3):371-382, 1995.
    • (1995) , vol.14 , Issue.3
    • Cazals, F.1    Drettakis, G.2    Puech, C.3
  • 4
    • 47249116891 scopus 로고    scopus 로고
    • T. Driemeyer and R. Herken, editors, 3rd ed. Springer
    • T. Driemeyer and R. Herken, editors. Programming mental ray, 3rd ed. Springer, 2005.
    • (2005) Programming mental ray
  • 8
    • 0023345059 scopus 로고
    • Automatic Creation of Object Hierarchies for Ray Tracing
    • May
    • J. Goldsmith and J. Salmon. Automatic Creation of Object Hierarchies for Ray Tracing. IEEE Computer Graphics SL Applications, 7(5): 14-20, May 1987.
    • (1987) IEEE Computer Graphics SL Applications , vol.7 , Issue.5 , pp. 14-20
    • Goldsmith, J.1    Salmon, J.2
  • 9
    • 0013046832 scopus 로고    scopus 로고
    • PhD thesis, Czech Technical University, Praha, Czech Republic
    • V. Havran. Heuristic Ray Shooting Algorithms. PhD thesis, Czech Technical University, Praha, Czech Republic, 2001.
    • (2001) Heuristic Ray Shooting Algorithms
    • Havran, V.1
  • 12
    • 0024926309 scopus 로고
    • Adaptive Voxel Subdivision for Ray Tracing
    • D. Jevans and B. Wyvill. Adaptive Voxel Subdivision for Ray Tracing. In Proc. Graphics Interface, pages 164-172, 1989.
    • (1989) Proc. Graphics Interface , pp. 164-172
    • Jevans, D.1    Wyvill, B.2
  • 17
    • 33646055524 scopus 로고    scopus 로고
    • ACM Transactions on Graphics (Proc. SIGGRAPH 2005)
    • 1176-1185
    • A. Reshetov, A. Soupikov, and J. Hurley. Multi-Level Ray Tracing Algorithm. ACM Transactions on Graphics (Proc. SIGGRAPH 2005), 24(3):1176-1185, 2005.
    • (2005) , vol.24 , Issue.3
    • Reshetov, A.1    Soupikov, A.2    Hurley, J.3
  • 18
    • 35349007523 scopus 로고    scopus 로고
    • M. Shevtsov, A. Soupikov, and A. Kapustin. Highly Parallel Fast KD-tree Construction for Interactive Ray Tracing of Dynamic Scenes. Computer Graphics Forum (Proc. Eurographics 2007), 26(3):to appear, 2007.
    • M. Shevtsov, A. Soupikov, and A. Kapustin. Highly Parallel Fast KD-tree Construction for Interactive Ray Tracing of Dynamic Scenes. Computer Graphics Forum (Proc. Eurographics 2007), 26(3):to appear, 2007.
  • 20
    • 0003438155 scopus 로고    scopus 로고
    • Efficiency Issues for Ray Tracing
    • B. Smits. Efficiency Issues for Ray Tracing. Journal of Graphics Tools, 3(2): 1-14, 1998.
    • (1998) Journal of Graphics Tools , vol.3 , Issue.2 , pp. 1-14
    • Smits, B.1
  • 21
    • 0003382414 scopus 로고
    • Ray Tracing with the BSP-tree
    • D. Kirk, editor, Academic Press
    • K. Sung and P. Shirley. Ray Tracing with the BSP-tree. In D. Kirk, editor, Graphics Gems III, pages 271-274. Academic Press, 1992.
    • (1992) Graphics Gems III , pp. 271-274
    • Sung, K.1    Shirley, P.2
  • 24
    • 84880807043 scopus 로고    scopus 로고
    • Ray Tracing Deformable Scenes using Dynamic Bounding Volume Hierarchies
    • I. Wald, S. Boulos, and P. Shirley. Ray Tracing Deformable Scenes using Dynamic Bounding Volume Hierarchies. ACM Transactions on Graphics, 26(1), 2006.
    • (2006) ACM Transactions on Graphics , vol.26 , Issue.1
    • Wald, I.1    Boulos, S.2    Shirley, P.3
  • 26
    • 42549172245 scopus 로고    scopus 로고
    • On building fast kD-trees for Ray Tracing, and on doing that in O(N log N)
    • Sept
    • I. Wald and V. Havran. On building fast kD-trees for Ray Tracing, and on doing that in O(N log N). In Proc. 2006 IEEE Symposium on Interactive Ray Tracing, pages 61-69, Sept. 2006.
    • (2006) Proc. 2006 IEEE Symposium on Interactive Ray Tracing , pp. 61-69
    • Wald, I.1    Havran, V.2
  • 29
    • 36948999360 scopus 로고    scopus 로고
    • S. Woop, G. Marmitt, and P. Slusallek. B-KD Trees for Hardware Accelerated Ray Tracing of Dynamic Scenes. In Proc. Graphics Hardware, pages 67-77, 2006.
    • S. Woop, G. Marmitt, and P. Slusallek. B-KD Trees for Hardware Accelerated Ray Tracing of Dynamic Scenes. In Proc. Graphics Hardware, pages 67-77, 2006.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.