DOI QR코드

DOI QR Code

A Soft Shadow Technique for a Real-time Mobile Ray Tracing Hardware

실시간 모바일 레이트레이싱 하드웨어를 위한 소프트 쉐도우 생성 기법

  • Kwon, Hyuck-Joo (Department of Electrical and Electronic Engineering, Yonsei University) ;
  • Hong, Dukki (Department of Computer Engineering, Sejong University) ;
  • Park, Woo-Chan (Department of Computer Engineering, Sejong University) ;
  • Lee, Sanghoon (Department of Electrical and Electronic Engineering, Yonsei University)
  • 권혁주 (연세대학교 전기전자공학과) ;
  • 홍덕기 (세종대학교 컴퓨터공학과) ;
  • 박우찬 (세종대학교 컴퓨터공학과) ;
  • 이상훈 (연세대학교 전기전자공학과)
  • Received : 2017.06.24
  • Accepted : 2017.07.06
  • Published : 2017.07.14

Abstract

In this paper, a novel soft shadow method is suggested to support realistic shadows in mobile ray tracing. In ray tracing, soft shadow is generally generated by sampling a shadow ray. As this sampling method increases the number of rays to be processed, it has undermined the performance. We designed the proposed soft shadow processing method and hardware architecture to overcome this problem through selective shadow generation and triangle address caching for minimizing the performance degradation caused by sampling. The proposed hardware architecture can be integrated into a mobile ray-tracing hardware and was evaluated in terms of its performance on the FPGA. Based on the results, the rendering performance about 4, 8, and 16 samples were improved, respectively, by 40%, 50%, and 56% on average compared to the previous method, and it was found that the real-time soft shadow processing is feasible with the proposed hardware architecture.

본 논문에서는 실시간 모바일 레이트레이싱에서 사실적인 그림자를 생성하기 위한 새로운 그림자 생성 기법을 제시한다. 일반적으로 레이트레이싱에서는 그림자 광선을 샘플링 하여 부드러운 그림자를 생성한다. 지금까지 이런 생성 방법은 처리해야 할 광선의 수를 증가시키기 때문에 성능 저하의 요인이 되어왔다. 제안하는 소프트 쉐도우 생성 기법과 하드웨어 구조는 선택적 그림자 생성과 삼각형 주소 캐싱을 통해 샘플링에 의한 성능 저하를 최소화시킴으로써 이런 문제를 해결하였다. 제안된 하드웨어 구조는 모바일 레이트레이싱 하드웨어에 통합 가능한 수준이며, FPGA상에서 성능 평가 되었다. 평가 결과 제안된 기법의 성능은 4, 8, 그리고 16 샘플에 대해서 이전 기법 대비 평균 40%, 50% 그리고 56% 수준으로 향상 되었으며, 우리는 제안된 하드웨어 구조를 통해 실시간으로 소프트 쉐도우를 생성할 수 있음을 확인하였다.

Keywords

References

  1. J. M. Hasenfratz, M. Lapierre, N. Holzschuch, and F. Sillion, "A survey of real-time soft shadows algorithms," Computer Graphics Forum, vol. 22, no. 4, pp. 753-774, Dec. 2003. https://doi.org/10.1111/j.1467-8659.2003.00722.x
  2. J.-H. Nah, H.-J. Kwon, D.-S. Kim, C.-H. Jeong, J. Park, T.-D. Han, D. Manocha, and W.-C. Park, "Raycore: A ray-tracing hardware architecture for mobile devices," ACM Transactions on Graphics, vol. 33, no. 5, p. 162, Aug. 2014. https://doi.org/10.1145/2629634
  3. T. Whitted, "An improved illumination model for shaded display," in Proceedings of the ACM SIGGRAPH Courses, 1979, p. 4.
  4. R. L. Cook, T. Porter, and L. Carpenter, "Distributed ray tracing," in Proceedings of the ACM SIGGRAPH Computer Graphics, 1984, pp. 137-145.
  5. S. Parker, W. Martin, P.-P. J. Sloan, P. Shirley, B. Smits, and C. Hansen, "Interactive ray tracing," in Proceedings of the ACM Symposium on Interactive 3D Graphics, 1999, pp. 119-126.
  6. S. Boulos, D. Edwards, J. D. Lacewell, J. Kniss, J. Kautz, and P. Shirley, "Interactive distribution ray tracing," Tech. Rep., 2006.
  7. S. Boulos, D. Edwards, J. D. Lacewell, J. Kniss, J. Kautz, P. Shirley, and I. Wald, "Packet-based whitted and distribution ray tracing," in Proceedings of the ACM Graphics Interface, 2007, pp. 177-184.
  8. K. Garanzha and C. Loop, "Fast ray sorting and breadth-first packet traversal for gpu ray tracing," Computer Graphics Forum, vol. 29, no. 2, pp. 289-298, May 2010. https://doi.org/10.1111/j.1467-8659.2009.01598.x
  9. C. Benthin and I. Wald, "Efficient ray traced soft shadows using multi-frusta tracing," in Proceedings of the ACM Conference on High Performance Graphics, 2009, pp. 135-144.
  10. T. Ize and C. Hansen, "Rtsah traversal order for occlusion rays," Computer Graphics Forum, vol. 30, no. 2, pp. 297-305, Apr. 2011. https://doi.org/10.1111/j.1467-8659.2011.01861.x
  11. N. Feltman, M. Lee, and K. Fatahalian, "Srdh: Specializing bvh construction and traversal order using representative shadow ray sets," in Proceedings of the ACM Conference on High Performance Graphics, 2012, pp. 49-55.
  12. P. Djeu, S. Keely, and W. Hunt, "Accelerating shadow rays using volumetric occluders and modified kd-tree traversal," in Proceedings of the ACM Conference on High Performance Graphics, 2009, pp. 69-76.
  13. J.-H. Nah and D. Manocha, "Sato: Surface area traversal order for shadow ray tracing," Computer Graphics Forum, vol. 33, no. 6, pp. 167-177, Sep. 2014. https://doi.org/10.1111/cgf.12341
  14. W.-J. Lee, Y. Shin, J. Lee, J.-W. Kim, J.-H. Nah, S. Jung, S. Lee, H.-S. Park, and T.-D. Han, "Sgrt: A mobile gpu architecture for real-time ray tracing," in Proceedings of the ACM Conference on High Performance Graphics, 2013, pp. 109-119.
  15. R. Overbeck, R. Ramamoorthi, and W. R. Mark, "Large ray packets for real-time whitted ray tracing," in Proceedings of the IEEE Symposium on Interactive Ray Tracing, 2008, pp.41-48.
  16. A. Reshetov, "Faster ray packets-triangle intersection through vertex culling," in Proceedings of the IEEE Symposium on Interactive Ray Tracing, 2007, pp. 105-112.
  17. S. Boulos, I.Wald, and P. Shirley, "Geometric and arithmetic culling methods for entire ray packets," Tech. Rep., 2006.
  18. E. R. Freniere, G. G. Gregory, and R. A. Hassler, "Edge diffraction in monte carlo ray tracing," in Proceedings of the SPIE's International Symposium on Optical Science, 1999, pp. 151-157.
  19. K. Komatsu, Y. Kaeriyama, K. Suzuki, H. Takizawa, and H. Kobayashi, "A fast ray prustum-triangle intersection algorithm with precomputation and early termination," IPSJ Online Transactions, vol. 1, pp. 1-11, Jul. 2008. https://doi.org/10.2197/ipsjtrans.1.1