Abstract
AbstractThe shortest ray path method based on graphic structure overcomes the drawbacks and limitations of traditional ray‐tracing methods, but the computation time and accuracy of the results need to be improved. This paper introduces Bresenham line algorithm into the traveltime calculating of nodes to improve the accuracy of traveltime and ray path results. To speed up computation, it uses QuickSort algorithm and Insertion Sort algorithm instead of usually used HeapSort algorithm. We take advantage of the node configuration presented in this paper to introduce the velocity interface, and accordingly get the algorithm of reflection ray tracing .Numerical tests proved that it is an flexible and efficient ray tracing method.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call