Wireless channel modeling has been a hot spot in wireless telecommunication for its complexity and its wide application. Channel modeling can be devided into three types:statictic model, half-statistic half-determined model, determined model.As the delegate of determined model, raytracing is widely used in mobile telecommunication and personal telecommunication. Being compared with statictic model and half-statistic half-determined model, determined model is more accurate but alse call for much more calculation and Scene modeling. When we need more accurate data, we always use it. Although raytracing will get the most accurate Field prediction, it will cost huge calculation. If we use traditional intersect test model, the computation is intolerable. Thus we need to use acceleration algorithm to make raytracing faster.The mainstream algorithm acceleration include Binary Space Partitioning(BSP), Space Voxel Partitioning(SVP) and Z-buffer Partitioning(AZB). Although there are many acceleration algorithm, they are all based on the same precondition:Pretreating the scene and decrease the intersection test between raypipe and intersect region to accelerate. This paper is main subject is analysing the base technology about many kinds of acceleration algorithm in raytracingm modeling the algorithm and compare the performance of each algorithm; and finally getting the conclusion. |