JOURNAL ARTICLE

Graph‐based shortest‐path algorithm for the ray tracing

Abstract

The paper presents a method for 2‐D and 3‐D seismic ray‐tracing using graph theory. The shortest path between the source and receiver is computed over the 'basis' graph where connections between vertices have weights proportional to the velocity of the underlying structure. The method guarantees a stable global minimum travel time, and does not require derivatives or initial value. It is particularly suitable for tracing seismic rays propagating in the inhomogeneous media, and is an extension of similar network‐based methods.

Keywords:
Computer science Shortest path problem Widest path problem Algorithm Tracing Graph Yen's algorithm Theoretical computer science Dijkstra's algorithm

Metrics

2
Cited By
0.00
FWCI (Field Weighted Citation Impact)
11
Refs
0.25
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Data Management and Algorithms
Physical Sciences →  Computer Science →  Signal Processing
Autonomous Vehicle Technology and Safety
Physical Sciences →  Engineering →  Automotive Engineering
Vehicular Ad Hoc Networks (VANETs)
Physical Sciences →  Engineering →  Electrical and Electronic Engineering

Related Documents

BOOK-CHAPTER

Dynamic Graph Shortest Path Algorithm

Xueli LiuHongzhi Wang

Lecture notes in computer science Year: 2012 Pages: 296-307
JOURNAL ARTICLE

A Fast Algorithm of the Shortest Path Ray Tracing

Meigen ZhangBing‐Jie ChengXiaofan LiMiao-Yue WANG

Journal:   Chinese Journal of Geophysics Year: 2006 Vol: 49 (5)Pages: 1315-1323
BOOK-CHAPTER

Some Improvement of the Shortest Path Ray Tracing Algorithm

Zoltán Wéber

Modern approaches in geophysics Year: 1995 Pages: 51-56
© 2026 ScienceGate Book Chapters — All rights reserved.