Massively parallel forward modeling of scalar and tensor gravimetry data
Computers & Geosciences
Geodesic Methods in Computer Vision and Graphics
Foundations and Trends® in Computer Graphics and Vision
Efficient algorithms for image and high dimensional data processing using eikonal equation on graphs
ISVC'10 Proceedings of the 6th international conference on Advances in visual computing - Volume Part II
Parallel re-initialization of level set functions on distributed unstructured tetrahedral grids
Journal of Computational Physics
Geometric correspondence for ensembles of nonregular shapes
MICCAI'11 Proceedings of the 14th international conference on Medical image computing and computer-assisted intervention - Volume Part II
A Fast Iterative Method for Solving the Eikonal Equation on Triangulated Surfaces
SIAM Journal on Scientific Computing
Computers & Mathematics with Applications
Out-of-Core Computations of High-Resolution Level Sets by Means of Code Transformation
Journal of Scientific Computing
The Chebyshev spectral viscosity method for the time dependent Eikonal equation
Mathematical and Computer Modelling: An International Journal
Fast Two-scale Methods for Eikonal Equations
SIAM Journal on Scientific Computing
Real-time navigation using randomized kinodynamic planning with arrival time field
Robotics and Autonomous Systems
A parallel fast sweeping method for the Eikonal equation
Journal of Computational Physics
| Hi-index | 0.01 |
In this paper we propose a novel computational technique to solve the Eikonal equation efficiently on parallel architectures. The proposed method manages the list of active nodes and iteratively updates the solutions on those nodes until they converge. Nodes are added to or removed from the list based on a convergence measure, but the management of this list does not entail an extra burden of expensive ordered data structures or special updating sequences. The proposed method has suboptimal worst-case performance but, in practice, on real and synthetic datasets, runs faster than guaranteed-optimal alternatives. Furthermore, the proposed method uses only local, synchronous updates and therefore has better cache coherency, is simple to implement, and scales efficiently on parallel architectures. This paper describes the method, proves its consistency, gives a performance analysis that compares the proposed method against the state-of-the-art Eikonal solvers, and describes the implementation on a single instruction multiple datastream (SIMD) parallel architecture.