메뉴 건너뛰기




Volumn 32, Issue 1, 2013, Pages 85-100

Fast insertion-based optimization of bounding volume hierarchies

Author keywords

BVH; ray tracing; surface area heuristics

Indexed keywords

COSTS; OPTIMIZATION; RAY TRACING;

EID: 84874935348     PISSN: 01677055     EISSN: 14678659     Source Type: Journal    
DOI: 10.1111/cgf.12000     Document Type: Article
Times cited : (34)

References (36)
  • 2
    • 51549087961 scopus 로고    scopus 로고
    • Shallow bounding volume hierarchies for fast SIMD ray tracing of incoherent rays
    • (June)
    • Dammertz H., Hanika J., Keller A.,: Shallow bounding volume hierarchies for fast SIMD ray tracing of incoherent rays. Computer Graphics Forum 27, 9 (June 2008), 1225-1233.
    • (2008) Computer Graphics Forum 27 , vol.9 , pp. 1225-1233
    • Dammertz, H.1    Hanika, J.2    Keller, A.3
  • 3
    • 47249152305 scopus 로고    scopus 로고
    • Early split clipping for bounding volume hierarchies early split clipping for bounding volume hierarchies
    • (September)
    • Ernst M., Greiner G.,: Early split clipping for bounding volume hierarchies early split clipping for bounding volume hierarchies. In IEEE Symposium on Interactive Ray Tracing (RT'2007) (September 2007), pp. 73-78.
    • (2007) IEEE Symposium on Interactive Ray Tracing (RT'2007) , pp. 73-78
    • Ernst, M.1    Greiner, G.2
  • 4
    • 84861389608 scopus 로고    scopus 로고
    • Automatic creation of object hierarchies for ray tracing dynamic scenes
    • (Pilsen, Bohemia, Czech Republic, January), V. Skala, (Ed.), WSCG, Pilsen, Bohemia, Czech Republic
    • Eisemann M., Grosch T., Magnor M., Mueller S.,: Automatic creation of object hierarchies for ray tracing dynamic scenes. In WSCG'2007 Short Papers Post-Conference Proceedings (Pilsen, Bohemia, Czech Republic, January 2007), V. Skala, (Ed.), WSCG, Pilsen, Bohemia, Czech Republic, pp. 57-64.
    • (2007) WSCG'2007 Short Papers Post-Conference Proceedings , pp. 57-64
    • Eisemann, M.1    Grosch, T.2    Magnor, M.3    Mueller, S.4
  • 7
    • 0013046832 scopus 로고    scopus 로고
    • PhD thesis, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, Nov
    • Havran V.,: Heuristic Ray Shooting Algorithms. PhD thesis, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, Nov 2000.
    • (2000) Heuristic Ray Shooting Algorithms
    • Havran, V.1
  • 14
    • 0022759969 scopus 로고
    • Ray tracing complex scenes
    • (New York, NY, USA, August), D. C. Evans, R. J. Athay (Eds.)
    • Kay T. L., Kajiya J. T.,: Ray tracing complex scenes. In SIGGRAPH '86 Proceedings (New York, NY, USA, August 1986), D. C. Evans, R. J. Athay, (Eds.), vol. 20, pp. 269-278.
    • (1986) SIGGRAPH '86 Proceedings , vol.20 , pp. 269-278
    • Kay, T.L.1    Kajiya, J.T.2
  • 18
    • 0010221212 scopus 로고
    • Heuristics for ray tracing using space subdivision
    • MacDonald J. D., Booth K. S.,: Heuristics for ray tracing using space subdivision. Visual Computer 6, 6 (1990), 153-165.
    • (1990) Visual Computer 6 , vol.6 , pp. 153-165
    • MacDonald, J.D.1    Booth, K.S.2
  • 19
    • 0037354092 scopus 로고    scopus 로고
    • Automatic hybrid hierarchy creation: A cost-model based approach
    • Masso J. P. M., Lopez P. G.,: Automatic hybrid hierarchy creation: A cost-model based approach. Computer Graphics Forum 22, 1 (2003), 5-13.
    • (2003) Computer Graphics Forum 22 , vol.1 , pp. 5-13
    • Masso, J.P.M.1    Lopez, P.G.2
  • 20
    • 33745467550 scopus 로고    scopus 로고
    • Memory-conserving bounding volume hierarchies with coherent raytracing
    • (June)
    • Mahovsky J., Wyvill B.,: Memory-conserving bounding volume hierarchies with coherent raytracing. Computer Graphics Forum 25, 10 (June 2006), 173-182.
    • (2006) Computer Graphics Forum 25 , vol.10 , pp. 173-182
    • Mahovsky, J.1    Wyvill, B.2
  • 21
    • 0013111818 scopus 로고
    • Tech. Rep. TR-89-063, International Computer Science Institute, Berkeley
    • Omohundro S. M.,: Five Balltree Construction Algorithms. Tech. Rep. TR-89-063, International Computer Science Institute, Berkeley, 1989.
    • (1989) Five Balltree Construction Algorithms
    • Omohundro, S.M.1
  • 25
    • 0019033416 scopus 로고
    • A 3-Dimensional Representation for Fast Rendering of Complex Scenes
    • (July)
    • Rubin S. M., Whitted T.,: A 3-Dimensional Representation for Fast Rendering of Complex Scenes. In SIGGRAPH '80 Proceedings (July 1980), vol. 14, pp. 110-116.
    • (1980) SIGGRAPH '80 Proceedings , vol.14 , pp. 110-116
    • Rubin, S.M.1    Whitted, T.2
  • 27
    • 0003438155 scopus 로고    scopus 로고
    • Efficiency issues for ray tracing
    • Smits B.,: Efficiency issues for ray tracing. Journal of Graphics Tools 3, 2 (1998), 1-14.
    • (1998) Journal of Graphics Tools 3 , vol.2 , pp. 1-14
    • Smits, B.1
  • 29
    • 81455158949 scopus 로고    scopus 로고
    • Fast construction of SAH BVHs on the Intel Many Integrated Core (MIC) architecture
    • (Jan)
    • Wald I.,: Fast construction of SAH BVHs on the Intel Many Integrated Core (MIC) architecture. IEEE Transactions on Visualization and Computer Graphics 18, 1 (Jan 2012), 47-57.
    • (2012) IEEE Transactions on Visualization and Computer Graphics 18 , vol.1 , pp. 47-57
    • Wald, I.1
  • 31
    • 84880807043 scopus 로고    scopus 로고
    • Ray tracing deformable scenes using dynamic bounding volume hierarchies
    • (Jan), DOI 10.1145/1189762.1206075
    • Wald I., Boulos S., Shirley P.,: Ray tracing deformable scenes using dynamic bounding volume hierarchies. ACM Transactions on Graphics 26, 1 (Jan 2007), DOI 10.1145/1189762.1206075.
    • (2007) ACM Transactions on Graphics 26 , vol.1
    • Wald, I.1    Boulos, S.2    Shirley, P.3
  • 36
    • 33748538254 scopus 로고    scopus 로고
    • Cache-efficient layouts of bounding volume hierarchies
    • (June)
    • Yoon S.-E., Manocha D.,: Cache-efficient layouts of bounding volume hierarchies. Computer Graphics Forum 25, (June 2006), 507-516.
    • (2006) Computer Graphics Forum 25 , pp. 507-516
    • Yoon, S.-E.1    Manocha, D.2


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