The shortest ray path method based on graphic structure overcomes the drawb
acks and limitations of traditional ray-tracing methods, but the computatio
n time and accuracy of the results need to be improved. This paper introduc
es Bresenham line algorithm into the traveltime calculation of nodes to imp
rove the accuracy of traveltime and ray path results. To speed up computati
on, we use Quick Sort algorithm and Insertion Sort algorithm instead of usu
ally used Heap Sort algorithm. We take advantage of the node configuration
presented in this paper to introduce the velocity interface, and accordingl
y get the algorithm of reflection ray tracing. Numerical tests show that it
is an accurate and efficient ray tracing method.