Concatenated Path Domain for Dijkstra’s Algorithm Based Ray Tracing to Enhance Computational Areas

Abstract

This paper provides a simulation method which can apply the Dijkstra’s algorithm (DA) based ray tracing to a large size of random rough surface (RRS). Since the RRS and path concatenations are performed, we can deal with this difficult problem even with a small size of personal computer (PC). By using the convolution method to generate 3D RRSs, concatenation of two adjacent RRSs is possible by keeping the random variables with respect to the 2D conjunction area between them. Concatenation of traced rays can also be executed by keeping the path data at the 2D conjunction area. First we start ray tracing for the first RRS with a source node, and next, keeping the 2D path data at the conjunction area, we move to the second RRS to execute ray tracing. We repeat this procedure until ray tracing for the last RRS is finished. All paths computed by the present method constitute shortest paths. However, the shortest paths thus obtained are different from the optical rays, and consequently three path modifications, path-linearization, path-selection and line of sight (LOS)-check, are required. Numerical examples reveal that the proposed concatenation method is an effective tool for a small size of PC to execute ray tracing along a large scale of RRS.