vBSP的算法设计与应用-《计算机技术与发展》

文章信息/Info

Author(s):: DUAN Fu; LI Qiang; School of Computer ＆ Software, Taiyuan University of Technology

摘要:: BSP数据结构已经在大规模的游戏引擎产品中取得了突破性的成功，但是在现实应用中还有许多需要实际改进后才能应用。为此，改进BSP开发出一种简单、灵活的解决方案，即虚拟BSP（vBSP）来解决应用实际应用。通过研究并改进原始的BSP树，意在使BSP树简单化、实用化，并可以减少算法的复杂度，降低其它改进算法的负面影响。基于“空间换时间”的思想，通过开辟引用存储空间而不是直接分割BSP树的方法，最终达到提高算法的实用性

Abstract:: BSP datastruct is successfully applied in great 3D game products,but this method must be improved to be applied virtually. This article will give a simple and flexible solution with an improved BSP method, that is virtual BSP which will resolve the application in practice. This paper will predigest algorithm complexity and make it more practicable and reduce the negative effect of improved solution by research on original BSP tree. The vBSP will use index buffer but dividing BSP tree which based on the idea of ＂Time can be ehangetl into Space＂. Finally, it improved the algorithm performance