Digital Commons Network^™

Fast Marching Methods - Parallel Implementation And Analysis, Maria Cristina Tugurlan

LSU Doctoral Dissertations

Fast Marching represents a very efficient technique for solving front propagation problems, which can be formulated as partial differential equations with Dirichlet boundary conditions, called Eikonal equation: $F(x)|\nabla T(x)|=1$, for $x \in \Omega$ and $T(x)=0$ for $x \in \Gamma$, where $\Omega$ is a domain in $\mathbb{R}^n$, $\Gamma$ is the initial position of a curve evolving with normal velocity F>0. Fast Marching Methods are a necessary step in Level Set Methods, which are widely used today in scientific computing. The classical Fast Marching Methods, based on finite differences, are typically sequential. Parallelizing Fast Marching Methods is a step forward for …