Earticle

초록

영어

In large scale game battle scenes or the virtual reality environment, the scale of the collision handling has been getting bigger and the importance of it has been gradually increasing. In order to compare the collision handling algorithms, this paper develops six different benchmark based on the Bullet physics engine. By massive rigid body collision simulations, the number of collision pairs, the CPU utilization, the memory usage, and the computation time are profiled. For the CPU utilization, the Simple algorithm is the best and provides 19.3% less compared to the other algorithms. In terms of the computation time, the Dbvt algorithm is the best and provides 8.85 times speedup than the worst Simple algorithm. The memory usage of the 32bitAxisSweep3 algorithm is the largest and is average 2.57 times more than the other algorithms. The optimal collision handling algorithm can be selected through performance profiling by considering the criteria such as the minimum computation time, the limited computing resources, the collision shapes and the number of rigid bodies.

목차

ABSTRACT
 1. 서론
 2. Bullet 물리엔진의 강체 충돌처리
  2.1 Bullet 강체 파이프라인 동작 흐름
  2.2 브로드페이즈 충돌 감지 알고리즘
  2.3 네로우페이즈 충돌 감지 알고리즘
 3. 성능 프로파일링
  3.1 벤치마크
  3.2 성능 프로파일링
 4. 결론
 참고문헌

키워드

저자

• 김영식 [ Youngsik Kim | 한국산업기술대학교 부교수 ] Corresponding author

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  컴퓨터게임및콘텐츠논문지(구 한국컴퓨터게임학회논문지) [Journal of Computer Games and Contents]

• 간기

  월간

• pISSN

  3091-7409

• eISSN

  3092-3638

• 수록기간

  2002~2026

• 등재여부

  KCI 등재

• 십진분류

  KDC 691 DDC 793