期刊文献+

基于BSP树的启发式阴影生成算法 被引量:2

A algorithm of Heuristic Shadow Based On BSP Tree
下载PDF
导出
摘要 阴影的生成在虚拟现实领域一直是个难题,特别是针对动态光源的大规模场景,目前还没有较成熟的阴影算法。通过对现有阴影生成算法和场景组织算法的研究,该文提出了基于二维空间分割树(BSP树)的启发式阴影生成算法:首先创建场景BSP树,随着观察者视点的改变,选取视剪裁体内的节点创建以光源为视点的遮挡体BSP树,然后通过对该BSP树的遍历拣选出阴影启发区内的物体,经过处理后BSP树只留下一些生成阴影必要的多边形大大减少了计算量,最后能够快速生成阴影。 Shadow plays an important role in realistic image synthesis. But the building of the shadow is a difficult problem in the field of the virtual reality. Nowadays, there is not a better algorithm in the mass scene. By the studying of the algorithm of building shadow and the organization of the scene, this paper describes the algorithm of heuristic shadow based on the Binary Space Partitioning trees ( BSP trees). At first, we build a BSP tree of scene, and select the node of the tree, which is clipped by the frustum of the sight. Then we build the BSP tree of the occlusion using the selected node and select the objects which are in the heuristic zone of the shadow again. After select twice, there are some polygons that are necessary to the building of the shadow in the BSP tree of the occlusion. So, we can build the shadow rapidly.
出处 《计算机仿真》 CSCD 2006年第6期220-223,共4页 Computer Simulation
关键词 阴影 二维空间分割树 启发式 Shadow BSP trees Heuristic
  • 相关文献

参考文献6

  • 1Frankin C Crow.Shadow Algorithms for Computer Graphics[C].In Computer Graphics (Proceedings of ACM SIGGRAPH 77),July 1977,ACM:242-248.
  • 2Samuel Ranta-Eskola.Binary Space Partitioning Trees and Polygon Removal in Real Time 3D Rendering[D].Sweden:Information Technology Computing Science Department Uppsala University.2001.8-9.
  • 3MASON WOO,JACKIE NEIDER,TOM DAVIS.OpenGL编程权威指南(第三版)[M].北京:中国电力出版社,2001.
  • 4李丽,战守义.一种凸多面体的阴影生成方法[J].计算机仿真,2004,21(5):133-135. 被引量:3
  • 5Harlen Costa Batagelo,Ilaim Costa Junior.Real-Time Shadow Generation Using BSP Trees and Stencil Buffers[C].Brazilian Symposium on Computer Graphics and Image Processing,1999.93-102.
  • 6杨戬,张应中,罗晓芳.基于BSP算法和模板缓存的阴影实现方法[J].计算机工程与设计,2003,24(9):35-37. 被引量:6

二级参考文献9

  • 1彭群生.计算机真实感图形的算法基础[M].北京:科学出版社,1989.113-110.
  • 2彭群生.计算机真实感图形的算法基础[M].北京:科学出版社,1989.113-110.
  • 3Fuchs H, Kedem Z M, Naylor B F. On visible surface generation by a priori tree structures[J]. Computer Graphics, 1980,14(3): 124-133.
  • 4Schumacker R, Brand B, Gilliland M, et al. Study for applying computer-generated images to visual simulation [R].Technical Report AFHRL-TR-69-14, NTIS AD700375, U.S.Air Force Human Resources Lab, Air Force Systems Command, Brooks AFB, TX. 1969.
  • 5Thibault W C, Naylor B G. Set operations on polyhedra using binary space partitioning trees [J]. Computer Graphics, 1987,21(4): 153-162.
  • 6Chin N, Feiner S. Near real-time shadow generation using bsp trees [J]. Computer Graphics, 1989, 23(3): 99-106.
  • 7RichardSWright Jr MichaelSweet.OpenGL超级宝典(第二版)[M].人民邮电出版社,2001-6..
  • 8孙家广.计算机图形学(第三版)[M].北京:清华大学出版社,2002..
  • 9R L Graham . An efficient algorithm for determining the convex hull of a finite planar set [ C ]. Info. Proc. Lett., 1972, ( 1 ): 132 - 133.

共引文献8

同被引文献10

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部