Generating numerical solutions to the eikonal equation and its many variations has a broad range of applications in both the natural and computational sciences. Efficient solvers on …
M Detrixhe, F Gibou, C Min - Journal of Computational Physics, 2013 - Elsevier
We present an algorithm for solving in parallel the Eikonal equation. The efficiency of our approach is rooted in the ordering and distribution of the grid points on the available …
A Chacon, A Vladimirsky - SIAM Journal on Scientific Computing, 2012 - SIAM
Fast Marching and Fast Sweeping are the two most commonly used methods for solving the eikonal equation. Each of these methods performs best on a different set of problems. Fast …
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 …
F Dang, N Emad - Procedia Computer Science, 2014 - Elsevier
The fast marching method is widely used to solve the eikonal equation. By introducing a new way of managing propagation interfaces which avoid the use of expensive data structures …
This paper presents an efficient, fine-grained parallel algorithm for solving the Eikonal equation on triangular meshes. The Eikonal equation, and the broader class of Hamilton …
W Jeong, R Whitaker - SIAM conference on Computational …, 2007 - researchgate.net
This paper presents a novel solver for the eikonal equation that is designed to run efficiently on massively parallel systems. The proposed method manages a list of active nodes and …
J Yang, F Stern - Journal of Computational Physics, 2017 - Elsevier
The fast marching method is a widely used numerical method for solving the Eikonal equation arising from a variety of scientific and engineering fields. It is long deemed …
The recent research trend of Eikonal solver focuses on employing state-of-the-art parallel computing technology, such as GPUs. Even though there exists previous work on GPU …