Earticle

초록

영어

Many computer graphics rendering algorithms and techniques use ray tracing for generation of photo-realistic images, and kd-tree is the most popular acceleration data structure for ray tracing. In order to avoid the inefficient parallel performance of kd-tree construction based on surface area heuristic (SAH), an algorithm using Morton code and path compression was present in this paper. Instead of building a kd-tree layer-by-layer, the proposed approach can be performed in parallel from bottom of a conceptual perfect binary tree. Experimental results on GPU show that our work achieves a faster kd-tree construction procedure.

목차

Abstract
 1. Introduction
  1.1. The Present and Problems of Ray Tracing
  1.2. The Present and Problems of KD-Tree
 2. The Basic Idea of Ray Tracing
  2.1. Acceleration Structure
  2.2. Morton Code
 3. Kd-Tree Construction based on Morton Code
  3.1. The Construction of Kd-Tree based on Morton Code
  3.2. Kd-tree based on Morton Code Construction on GPU
 4. Experimental Results
  4.1 Experimental Environment
  4.2 Experimental Results and Analyses
 5. Conclusion and Future Work
 References

키워드

저자

• Zhang Peicheng [ School of Computer Engineering and Science, Shanghai University, Shanghai, China ]
• Xu Huahu [ Shanghai Shang Da Hai Run Information System Co., Ltd ]
• Bian Minjie [ School of Computer Engineering and Science, Shanghai University, Shanghai, China ]
• Honghao [ School of Computer Engineering and Science, Shanghai University, Shanghai, China / Computing Center, Shanghai University, Shanghai, P.R. China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Grid and Distributed Computing

• 간기

  격월간

• pISSN

  2005-4262

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605