A Fast Iterative Method for Eikonal Equations

In this paper we propose a novel computational technique to solve the Eikonal equation. 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 the the 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, performs fewer computations per node 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, such as cluster systems or graphics processing units. This paper describes the method, proves its consistency, and gives a performance analysis that compares the proposed method against the state-of-the...

• Type: Journal
• Year: 2008
• Where: SIAMSC
• Authors: Won-Ki Jeong, Ross T. Whitaker
• Keywords: Active Nodes, Expensive Ordered Data, SIAMSC 2008, Special Updating Sequences