Implicit domain decomposition parallelization for the reconstruction of the level set function by the fast marching method

To futher raise the shared-memory-based parallelization efficienty for reconstruction of level set function, an algorithm based on implicit domain decomposition is introduced. This method only separates the interface in advance rather than decomposing the domain beforehand and enables parallel fast marching reconstruction synchronized with domain decomposition. On the basis of the results of fast marching parallel reconstruction of isosurfaces, e.g., sphere, Zalesak's sphere, and dumbbell, the runtime of the implicit domain decomposition method is shorter than that of the explicit partitioning method. Moreover, the speedup ratio of the implicit method is nearly similar to that of the explicit method, in which the speedup ratio of the implicit method can reach 4 under eight threads. Furthermore, the number of re-evolution operations of nodes in the implicit domain decomposition method is smaller than that of the rollback operations of nodes in the explicit method. © 2020, Editorial Department of Journal of HEU. All right reserved.