Fast Algorithm of the Traveltime Calculation Based on Binomial Heap Sorts

Juan Wang

doi:10.4028/www.scientific.net/AMR.267.857

Paper Titles

Research on Three-Dimensional Methods to Psychology Skills Training of Badminton Players in College
p.837

Fuzzy Comprehensive Evaluation of the Garment CAD
p.843

Rescue Robot Navigation in Grid Computing Environment
p.848

Application of Fuzzy Logical in IDS
p.852

Fast Algorithm of the Traveltime Calculation Based on Binomial Heap Sorts
p.857

Vehicle Access Intelligent Monitoring and Network Management System Based on RFID Technology
p.862

A Visual-Thermal Image Sequence Registration Method Based on Motion Status Statistic Feature Multi-Resolution Analysis
p.867

An Image Mosaic Algorithm Taking into Account Speed and Robustness
p.873

Design of an E-Learning Based on Service Software Bus
p.879

HomeAdvanced Materials ResearchAdvanced Materials Research Vol. 267Fast Algorithm of the Traveltime Calculation Based...

Fast Algorithm of the Traveltime Calculation Based on Binomial Heap Sorts

Abstract:

Traveltime calculation has been applied in many project extensively such as earthquake simulation, prestack migration, tomographic imaging, velocity analysis. finite-difference solution of the eikonal equation along expanding wavefronts had two prominent characteristics:one was wavefront points update very frequent, Usually insert some new wavefronts points after extacting one minimum point every time;the other was that the new calculated wavefronts’s traveltime was usually large.Therefore,the paper introduced binomial heap sorts method, optimizated the method of inserting new wavefronts and removing the minimum point in wavefronts, ensured the search efficiency, and had good time complexity.

You might also be interested in these eBooks

Manufacturing Systems and Industry Application

View Preview

Info:

Periodical:

Advanced Materials Research (Volume 267)

Pages:

857-861

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.267.857

Citation:

Cite this paper

Online since:

June 2011

Authors:

Juan Wang

Keywords:

Binomial Heap Sort, Expanding Wavefronts, Traveltime Calculation

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Qin F, Olsen K B, Luo Y, et al. Finite-difference solution of the eikonal equation along expanding wavefro-nts[J]. Geophysics, 1992, 57(3): 478~487.

DOI: 10.1190/1.1443263

Google Scholar

[2] YANG Hao, SUN Jian-guo, HAN Fu-xing, MA Shu-fang. Fast Algorithm of the Expanding Wavefronts Finite-Difference Traveltime Calculation Based on the Three Branch Tree Structure Heap Sorts. Journal of Jilin University (Earth Science Edition), V01. 40, No. 1, Jan. (2010).

Google Scholar

[3] Vidale J. Finite-difference calculation of traveltimes [J]. Bulletin of the Seismological Society of America, 1988, 78(6): 2062~2 076.

Google Scholar

[4] Thomas H. Cormen, Charles E. Leiserson, Ronald L. Revest, and Clifford Stein, Introduction To Algorithms, McGraw-Hill Higher Education, second edition, (2001).

Google Scholar

[5] Trier V J, Symes W W. Upwind finite-difference calculation of travetimes[J]. Geophysics, 1991, 56(6): 812~821.

DOI: 10.1190/1.1443099

Google Scholar

[6] Sun J．Geometrical ray theory：edge-diffracted rays and their traveltimes (second—order approximation of the traveltimes)[J]. Geophysics, 1994, 59: 148-155.

DOI: 10.1190/1.1443526

Google Scholar