Abstract
A technique for improving the efficiency of the shortest path ray tracing (SPR) algorithm is presented. We provide quantitative measures to determine the accuracy of SPR with varying numbers of connections per node. Our improvement consists of a method that finds more accurate rays in regions of low velocity contrast than that yielded by the original SPR algorithm. This allows the researcher to use fewer connections per node and, as a consequence, to save computer time. In two-dimensional experiments we find that the improved algorithm requires about 80 percent less connections per node saving 70 percent of elapsed time. In three-dimensional tomographic applications these savings should be even greater.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
