A Fast Algorithm of the Shortest Path Ray Tracing

2006 ◽  
Vol 49 (5) ◽  
pp. 1315-1323 ◽  
Author(s):  
Mei-Gen ZHANG ◽  
Bing-Jie CHENG ◽  
Xiao-Fan LI ◽  
Miao-Yue WANG
Keyword(s):  
Ray Tracing ◽  
Shortest Path ◽  
Fast Algorithm

Fast algorithm and numerical simulation for ray-tracing in 3D structure

2008 ◽  
Vol 15 (6) ◽  
pp. 901-905 ◽  
Author(s):  
Er-gen Gao ◽  
An-jia Zhang ◽  
Uk Han ◽  
Shu-yun Song ◽  
Yong-bo Zhai
Keyword(s):  
Numerical Simulation ◽  
Ray Tracing ◽  
Fast Algorithm ◽  
3D Structure

Seismic complex ray tracing in 2D/3D viscoelastic anisotropic media by a modified shortest-path method

Geophysics ◽  
2020 ◽  
Vol 85 (6) ◽  
pp. T331-T342
Author(s):  
Xing-Wang Li ◽  
Bing Zhou ◽  
Chao-Ying Bai ◽  
Jian-Lu Wu
Keyword(s):  
Ray Tracing ◽  
Shortest Path ◽  
Anisotropic Medium ◽  
Wave Energy ◽  
Seismic Data ◽  
Seismic Waves ◽  
Effective Means ◽  
Anisotropic Media ◽  
The Real ◽  
Complex Ray

In a viscoelastic anisotropic medium, velocity anisotropy and wave energy attenuation occur and are often observed in seismic data applications. Numerical investigation of seismic wave propagation in complex viscoelastic anisotropic media is very helpful in understanding seismic data and reconstructing subsurface structures. Seismic ray tracing is an effective means to study the propagation characteristics of high-frequency seismic waves. Unfortunately, most seismic ray-tracing methods and traveltime tomographic inversion algorithms only deal with elastic media and ignore the effect of viscoelasticity on the seismic raypath. We have developed a method to find the complex ray velocity that gives the seismic ray speed and attenuation in an arbitrary viscoelastic anisotropic medium, and we incorporate them with the modified shortest-path method to determine the raypath and calculate the real and imaginary traveltime (wave energy attenuation) simultaneously. We determine that the complex ray-tracing method is applicable to arbitrary 2D/3D viscoelastic anisotropic media in a complex geologic model and the computational errors of the real and imaginary traveltime are less than 0.36% and 0.59%, respectively. The numerical examples verify that the new method is an effective and powerful tool for accomplishing seismic complex ray tracing in heterogeneous viscoelastic anisotropic media.

The Study of Diffraction Ray Tracing on the Surface of Airplane

2012 ◽  
Vol 433-440 ◽  
pp. 6345-6349
Author(s):  
Li Peng Deng ◽  
Xiao Ying Zhao ◽  
You Feng Chen ◽  
Wang Jing
Keyword(s):  
Ray Tracing ◽  
Shortest Path ◽  
Convex Surface ◽  
Local Algorithm ◽  
Dijkstra Algorithm ◽  
End Point

This article makes the surface of airplane into quadrilateral gridding by using the method of discrete gridding generation, and calculates the data of gridding by using the classical Dijkstra algorithm (local algorithm) which can seek the shortest path from the start point and the end point. With that we can achieve diffraction ray tracing. This method can be used for any convex surface of the diffraction ray tracing.

Reachability for airline networks: fast algorithm for shortest path problem with time windows

2018 ◽  
Vol 749 ◽  
pp. 66-79 ◽  
Author(s):  
Xiaofeng Gao ◽  
Yueyang Xianzang ◽  
Xiaotian You ◽  
Yaru Dang ◽  
Guihai Chen ◽  
...  
Keyword(s):  
Shortest Path ◽  
Fast Algorithm ◽  
Time Windows ◽  
Shortest Path Problem ◽  
Airline Networks

A Fast Algorithm for Constructing Sparse Euclidean Spanners

1997 ◽  
Vol 07 (04) ◽  
pp. 297-315 ◽  
Author(s):  
Gautam Das ◽  
Giri Narasimhan
Keyword(s):  
Greedy Algorithm ◽  
Shortest Path ◽  
Connected Graph ◽  
Fast Algorithm ◽  
Dimensional Space ◽  
Time Algorithm ◽  
Real Constant ◽  
Clustering Techniques ◽  
Positive Edge ◽  
The Greedy Algorithm

Let G = (V,E) be a n-vertex connected graph with positive edge weights, and let t > 1 be a real constant. A subgraph G' is a t-spanner if for all u,v ∊ V, the weight of the shortest path between u and v in G' is at most t times the weight of the corresponding shortest path in G. We design an O(n log 2 n) time algorithm which, given a set V of n points in k-dimensional space (for any fixed k), and any real constant t > 1, produces a t-spanner of the complete Euclidean graph of V. This algorithm retains the spirit of a recent O(n3 log n) time greedy algorithm which produces t-spanners; we use graph clustering techniques to achieve a more efficient implementation. Our spanners have O(n) edges and weight O(1)· wt(MST), which is similar to the size and weight of spanners constructed by the greedy algorithm. The constants implicit in the O-notation depend upon t and k.

2D efficient ray tracing with a modified shortest path method

2009 ◽  
Vol 40 (4) ◽  
pp. 301-307 ◽  
Author(s):  
Meigen Zhang ◽  
Liyun Fu ◽  
Xinfu Li ◽  
Xiaofan Li
Keyword(s):  
Ray Tracing ◽  
Shortest Path
Sign in / Sign up

Export Citation Format

Share Document