An Easily Implemented, Block-Based Fast Marching Method with Superior Sequential and Parallel Performance

  title={An Easily Implemented, Block-Based Fast Marching Method with Superior Sequential and Parallel Performance},
  author={Jianming Yang},
  journal={SIAM J. Sci. Comput.},
  • Jianming Yang
  • Published 31 October 2018
  • Computer Science
  • SIAM J. Sci. Comput.
The fast marching method is well-known for its worst-case optimal computational complexity in solving the Eikonal equation, and has been employed in numerous scientific and engineering fields. However, it has barely benefited from fast-advancing multi-core and many-core architectures, due to the challenges presented by its apparent sequential nature. In this paper, we present a straightforward block-based approach for a highly scalable parallelization of the fast marching method on shard-memory… 

Shared-memory block-based fast marching method for hierarchical meshes

Recut: a Concurrent Framework for Sparse Reconstruction of Neuronal Morphology

Recut, an automated and accelerated neural reconstruction pipeline, which provides a unified, and domain specific sparse data representation with 79× reduction in the memory footprint, and is the first fully parallelized end-to-end automated reconstruction pipeline for light microscopy.



A highly scalable massively parallel fast marching method for the Eikonal equation

A Fast Iterative Method for Eikonal Equations

The proposed method manages the list of active nodes and iteratively updates the solutions on those nodes until they converge and uses only local, synchronous updates and therefore has better cache coherency, is simple to implement, and scales efficiently on parallel architectures.

A parallel fast sweeping method for the Eikonal equation

A Parallel Two-Scale Method for Eikonal Equations

A parallelization of HCM for a shared memory architecture shows that the parallel HCM exhibits good algorithmic behavior and scales well, resulting in a very fast and practical solver.

Fast Marching Methods

The development of Fast Marching Methods is reviewed, including the theoretical and numerical underpinnings; details of the computational schemes, including higher order versions; and examples of the techniques in a collection of different areas are demonstrated.

An O(N) Level Set Method for Eikonal Equations

The article is concerned with the development of an $\cal O(N)$ level set algorithm called the group marching method (GMM), based on the narrow band approach as in the FMM, but incorporating a correction-by-iteration strategy to advance a group of grid points at a time.

A Domain Decomposition Parallelization of the Fast Marching Method

Abstract : Evolving interfaces play an important role in a multitude of different areas, ranging from fluid mechanics, combustion, and grid generation to material sciences, semiconductor