首页> 外文会议>International conference on frontier computing: theory, technologies and applications >Comparison of BVH and KD-Tree for the GPGPU Acceleration on Real Mobile Devices
【24h】

Comparison of BVH and KD-Tree for the GPGPU Acceleration on Real Mobile Devices

机译:BVH和KD树对真实移动设备GPGPU加速的比较

获取原文

摘要

Portability and thermal issues significantly limit the performance of mobile devices, hindering the use of the global illumination that enables high-quality rendering. For a long time, the BVH and KD-tree algorithms through GPU acceleration have been widely used to accelerate global illumination in the desktop environment. However, these algorithms have not been sufficiently studied in the mobile environment, and therefore, the use of either of them presents many challenges. This paper describes the implementation of BVH and KD-tree algorithms that utilize GPU acceleration on mobile devices. The experimental results show that the path tracing performance can be increased 2.3 times on average when KD-tree is used and that KD-tree can improve the performance more than BVH. To the best of our knowledge, this study is the first to examine BVH and KD-tree in the real mobile environment.
机译:可移植性和热问题显着限制了移动设备的性能,妨碍了实现了实现高质量渲染的全局照明。长期以来,通过GPU加速的BVH和KD树算法已被广泛用于加速桌面环境中的全局照明。然而,这些算法在移动环境中没有充分研究,因此,其中任何一个都存在许多挑战。本文介绍了利用移动设备上使用GPU加速的BVH和KD树算法的实现。实验结果表明,当使用KD树时,平均水平跟踪性能可以平均增加2.3倍,并且KD树可以提高性能超过BVH。据我们所知,这项研究是第一个在真正的移动环境中检查BVH和KD树的首选。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号