Journal of Korea Game Society (한국게임학회 논문지)

Korea Game Society (한국게임학회)
권호 표지
DOI QR코드

DOI QR Code

Tree Build Heuristics for Spatial Partitioning Trees of 3D Games

3D 게임 공간 분할 트리에서 트리 빌드 휴리스틱

  • Kim, Youngsik (Dept. of Game & Multimedia Engineering, Korea Polytechnic University)
  • 김영식 (한국산업기술대학교 게임공학과)
  • Received : 2013.07.19
  • Accepted : 2013.08.12
  • Published : 2013.08.20
Download PDF
⟨ Previous Next ⟩

Abstract

Spatial partitioning trees are needed for processing collision detections efficiently. In order to select split planes for spatial partitioning trees, the tree balance and the number of polygons overlapped with the split plane should be considered. In this paper, the heuristic algorithm controlling weight values of tree build criteria is proposed for spatial partitioning trees of 3D games. As the weight values are changed, tree build time, T-junction elimination time which can cause visual artifacts in splitting polygons overlapped with the split plane, rendering speed (frame per second: FPS) according to tree balance are analysed under 3D game simulations.

3D 게임에서 충돌 탐지를 효과적으로 하기 위해 구성하는 공간 분할 트리는 분할 평면을 결정하는데 트리 밸런스와 분할 평면과 겹치는 폴리곤의 개수 등을 고려해야 한다. 본 논문에서는 3D 게임 공간 분할 트리에서 트리 빌드 조건에 대한 가중치를 제어하는 휴리스틱 알고리즘을 제안하였다. 가중치의 변화에 따라서 트리 빌드 시간, 분할 평면과 겹치는 폴리곤을 쪼갤 때 시각적 불일치를 유발할 수 있는 T-junction 의 제거 시간, 트리 밸런스에 따른 렌더링 속도(frame per second) 등을 3D 게임 시뮬레이션을 통하여 분석하였다.

Keywords

References

  1. Game Institute, Graphics Programming with Direct X: Module II (Book 2) chapter 14, chapter 16, E-INSTITUTE PUBLISHING INC, www.gameinstitute.com, 2004.
  2. Eric Lengyel, Mathematics for 3D Game Programming and Computer Graphics, Second Edition, Charles River Media, Inc., 2004.
  3. Youngsik Kim, "T-junction Elimination for Spatial Partitioning Trees of 3D Games," Digital Contents Society Conference 2009, Vol. 10, No. 1, 2009.
  4. Christer Ericson. Real-Time Collision Detection. The Morgan Kaufman series in interactive 3D technology. Morgan Kaufmann, 2005.
  5. Kun Zhou, Qiming Hou, Rui WangBaining Guo, "Real-time KD-tree construction on graphics hardware," ACM Transactions on Graphics - Proceedings of ACM SIGGRAPH Asia 2008 Volume 27 Issue 5, December 2008.
  6. Jae-Ho Nah, Woo-Chan Park, Tack-Don Han, "A Shadow Culling Algorithm for Interactive Ray Tracing," Journal of Korea Game Society, Vol. 9, No. 6, pp.179-190, 2009
  7. Sangduk Kim, Jin-Woo Kim, Woo-Chan Park, Tack-Don Han, "Bounding Box based Shadow Ray Culling Method for Real-Time Ray Tracer," Journal of Korea Game Society, Vol. 13, No. 3, pp.85-94, 2013. https://doi.org/10.7583/JKGS.2013.13.3.85
  8. Goldsmith, and J. Salmon, "Automatic creation of object hierarchies for ray tracing," IEEE Computer Graphics and Applications, Volume 7, Issue 5, pp14-20. May 1987.
  9. I. Wald, and V. Havran, "On building fast kd-trees for ray tracing, and on doing that in O(Nlog N)," In Proceedings of IEEE Symposium on Interactive Ray Tracing, pp61-69, 2006.
  10. G. Stoll, "Part II: Achieving real time - optimization techniques," In SIGGRAPH 2005 Course on Interactive Ray Tracing, 2005.
  11. I. Wald, J. G¨unther, and P. Slusallek, "Balancing considered harmful - faster photon mapping using the voxel volume heuristic," In Proceedings of Eurographics'04, pp595-603, 2004.
  12. V. Havran, "Heuristic Ray Shooting Algorithms," PhD thesis, Czech Technical University in Prague, 2001.
  13. Hyuk Kim, "KD-Tree construction using surface visibility heuristic," Dept. of computer engineering, Sogang Univ., Master thesis, 2010.
  14. Byungjoon Chang and Insung Ihm, "Performance Analysis and Enhancing Techniques of Kd-Tree Traversal Methods on GPU," Journal of KIISE:Computing Practices and Letters, Vol. 16, No. 2, pp171-185, 2010.

Cited by

  1. An Effective Structure of Hardware Compression for Potentially Visible Set of Indoor 3D Game Scenes vol.14, pp.6, 2014, https://doi.org/10.7583/JKGS.2014.14.6.29