期刊文献+

动态网络最短路径射线追踪 被引量:2

Shortest path raytracing method with dynamic networks
下载PDF
导出
摘要 当前广泛使用的最短路径射线追踪算法,用预先设置好的网络节点的连线表示实际波传播路径,在网络节点稀疏时,获得的射线路径呈之字形,计算出的旅行时比实际旅行时系统偏大。本文在波前扩展过程中,通过在每个矩形单元内对已知旅行时节点进行插值,并利用Fermat原理即时求出从该单元边界上到达某一节点的最小旅行时及其子震源位置和射线路径,发展了相应的动态网络算法,克服了原最短路径射线追踪算法的缺陷,大大提高了最小旅行时和射线路径的计算精度。 The widly used shortest path raytracing algorithm in networks depends on the preset beelines between networknodes are used to approximate the ray paths. When using a few nodes and the ray usually following a zig-zag path thecalculated traveltime is larger than the real one. To solve this problem, we develop a shortest path raytracing methodwith dynamic networks. In the process of expanding wavefront from source, we use interpolation betweenknown traveltime nodes and Fermat's Principle to find the point at edges of the cell from which the ray reaches a nodewith the shortest path , meanwhile the subwave source location and raypaths are evaluated. So the drawbacks ofconventional methods are overcome, and the precision of calculated seismic minimal traveltime and raypaths isimproved greatly.
出处 《油气地球物理》 2003年第4期13-18,共6页 Petroleum Geophysics
关键词 动态网络 最短路径射线 追踪算法 旅行时 计算精度 地震勘探 shortest path algorithm, dynamic network, seismic wavefront, raypaths
  • 相关文献

参考文献1

  • 1E. W. Dijkstra. A note on two problems in connexion with graphs[J] 1959,Numerische Mathematik(1):269~271

同被引文献16

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部