Time Consumption Reduction of Ray Tracing for Rcs Prediction using Efficient Grid Division and Space Division Algorithms

Kd-Tree Based Fast Ray Tracing for RCS Prediction

“…The simple ship is the second validated target defined in [14][15][16], where some of the geometric details are unknown. Hence, a new ship is modeled based on the available geometric parameters (0.9×0.2×0.2 m), as shown in Fig.…”

“…6(a). As this ship is not identical with the one in [14][15][16], which provide the measured data, a MLFMM result is used to verify the accuracy. observed between these two results.…”

“…The aim of this paper is the use of the kd-tree and the mailbox technique to accelerate the ray tracing in the SBR, therefore, an elaborate study on the computational efficiency is presented in the fashion similar to [14][15][16]. All calculations were performed in a 2.8 GHz Pentium(R) D CPU and the computation times are the total time of all incident angles.…”

“…The adaptive grid division method has been proposed to reduce the initial number of rays [14,15]. On the other hand, the key idea to reduce the number of intersection tests is the use of acceleration data structures.…”

“…Once the acceleration structure is constructed, the rays for all incident and reflected rays could be traced effectively. The octree, recursively subdividing the box into eight children boxes using three axis-perpendicular planes, has been used to reduce the number of intersection tests with the assumption that patches are uniformly distributed in the target space [15,16].…”