Korean Journal of Computational Design and Engineering (한국CDE학회논문집)

Society for Computational Design and Engineering (한국CDE학회)
권호 표지

A Study on the Real Time Culling of Infinite Sets of Geometries Using OSP Tree

OSP Tree를 이용한 무한순차 입력 형상의 실시간 컬링에 관한 연구

  • Published : 2003.06.01
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, OSP(Octal Space Partitioning) tree is proposed for the real time culling of infinite sets of geometries in interactive Virtual Environment applications. And MSVBSP(Modified Shadow Volume BSP) tree is suggested for the occlusion culling. Experimental results show that the OSP and MSVBSP tree are efficiently implemented in real time rendering of interactive geometries.

Keywords

References

  1. Proceedings of the 2001 Symposium on Interactive 3D Graphics CavePainting: A Fully Immer-sive 3D Artistic Medium and Interactive Experience Keefe,D.;Acevedo,D.
  2. Proceedings of SIGGRAPH'91 v.25 no.4 Visibility Preprocessing for Inter-active Walkthroughs Teller,J.;Sequin,H. https://doi.org/10.1145/127719.122725
  3. gametutorials 홈페이지
  4. 한국CAD/CAM학회 논문집 v.7 no.4 인터넷을 통한 3D 형상 데이터의 실시간 전송을 위한 효율적인 Octree 인코딩 방법에 관한 연구 류중현;김영우;김덕수
  5. Proceeding 1997 Symp-osium on Interactive 3D Graphics Real-Time Occlusion Culling for Models with Large Occluders Coorg,S.;Teller,S.
  6. Proc. 13th Annual ACM Symposium on Computational Geometry Accelerated Occlusion Culling using Shadow Frusta Hudson,T.;Manocha,D.
  7. Proceedings of SIGGRAPH'89 v.23 no.3 Near Real-time Shadow Generation using BSP Trees Chin,N.;Feiner,S. https://doi.org/10.1145/74334.74343
  8. Proceedings of SIGGRAPH '96 Hierarchical Polygon Tiling with Coverage Masks Greene,N.