Name
Title | ||
|---|---|---|
An adaptive domain-decomposition technique for parallelization of the fast marching method |
Abstract | ||
|---|---|---|
The fast marching method (FMM) is an efficient technique to solve numerically the Eikonal equation. The parallelization of the FMM is not easy because of its intrinsic sequential nature. In this paper we propose a novel approach to parallelize the FMM. It leads to an equation-dependent domain decomposition and it turns out to be particularly suitable for machines with two or four cores that are in common use today. Compared to other techniques in the field, the proposed method is much simpler to implement and it gives a slightly better computational speed-up. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.amc.2011.05.041 | Applied Mathematics and Computation |
Keywords | Field | DocType |
Parallel methods,Eikonal equation,Hamilton–Jacobi equations,Shape from Shading | Mathematical optimization,Fast marching method,Mathematical analysis,Parallel computing,Eikonal equation,Mathematics,Photometric stereo,Domain decomposition methods,Speedup | Journal |
Volume | Issue | ISSN |
218 | 1 | 0096-3003 |
Citations | PageRank | References |
5 | 0.56 | 24 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael Breuß | 1 | 168 | 25.45 |
| Emiliano Cristiani | 2 | 132 | 12.58 |
| Pascal Gwosdek | 3 | 70 | 5.78 |
| Oliver Vogel | 4 | 95 | 10.68 |