A variational-level-set based partitioning method for block-structured meshes

TL;DR

This paper introduces a simplified variational level-set method for block-structured mesh partitioning, improving efficiency and accuracy in complex 2D and 3D parallel computing scenarios.

Contribution

A novel single-level-set formulation reduces complexity and enhances computational efficiency for large-scale mesh partitioning problems.

Findings

Accurate results in 2D and 3D mesh partitioning

Rapid convergence and robustness in complex cases

Efficient CPU time performance in realistic scenarios

Abstract

We propose a numerical method for solving block-structured mesh partitioning problems based on the variational level-set method of (Zhao et al., J Comput Phys 127, 1996) which has been widely used in many partitioning problems such as image segmentation and shape optimization. Here, the variational model and its level-set formulation have been simplified that only one single level-set function is evolved. Thus, the numerical implementation becomes simple, and the computational and memory overhead are significantly alleviated, making this method suitable for solving realistic block-structured mesh partitioning problems where a large number of regions is required. We start to verify this method by a range of two-dimensional and three-dimensional uniform mesh partitioning cases. The results agree with the theoretical solutions very well and converge rapidly. More complex cases, including block-structured adaptive mesh partitioning for single-phase and multi-phase multi-resolution simulations, confirm the accuracy, robustness and good convergence property. The measured CPU time shows that this method is efficient for both two-dimensional and three-dimensional realistic partitioning problems in parallel computing. The proposed method has the potential to be extended to solve other partitioning problems by replacing the energy functional.