Loading...
Please wait, while we are loading the content...
Similar Documents
Shortest-path calculation of first arrival traveltimes by expanding wavefronts
| Content Provider | Semantic Scholar |
|---|---|
| Author | Urdaneta, Hector Biondi, Biondo |
| Copyright Year | 2001 |
| Abstract | A new approach to computing traveltimes and ray paths by solving the shortest path problem is presented. The technique is based on a partitioning of the shortest path optimization problem into smaller problems. We recursively evaluate the solution on expanding wavefronts instead of finding the global shortest paths from the source. To solve the local minimization, we apply a modified version of the Bellman-Ford optimization algorithm because of its suitability for a parallel implementation in three dimensions. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://sepwww.stanford.edu/data/media/public/docs/sep82/hector.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |