Penalty function-based volumetric parameterization method for isogeometric analysis

Journal Article (2022)
Author(s)

Ye Ji (Key Laboratory for Computational Mathematics and Data Intelligence of Liaoning Province, Dalian University of Technology)

Meng-Yun Wang (Key Laboratory for Computational Mathematics and Data Intelligence of Liaoning Province, Dalian University of Technology)

Mao-Dong Pan (Key Laboratory of Mathematical Modelling and High Performance Computing of Air Vehicles, Nanjing University of Aeronautics and Astronautics)

Yi Zhang (Key Laboratory for Computational Mathematics and Data Intelligence of Liaoning Province, Dalian University of Technology)

Chun-Gang Zhu (Dalian University of Technology, Key Laboratory for Computational Mathematics and Data Intelligence of Liaoning Province)

DOI related publication
https://doi.org/10.1016/j.cagd.2022.102081 Final published version
More Info
expand_more
Publication Year
2022
Language
English
Journal title
Computer Aided Geometric Design
Volume number
94
Article number
102081
Downloads counter
293

Abstract

In isogeometric analysis, constructing bijective and low-distorted parameterizations is a fundamental task. Compared with the planar problem, the volumetric case is more challenging in both robustness and efficiency. In this paper, we present a robust and efficient volumetric parameterization method based on the idea of penalty functions and the Jacobian regularization technique. The proposed method does not require an already bijective initialization and thus avoids an extra foldover elimination step. The main contributions of this work lie in three aspects. First, a new objective function that characterizes the volume distortion is established using the Divergence Theorem. Second, we employ a novel penalty function for the Jacobian regularization. The full analytical gradient of the objective function is also deduced to enhance the numerical stability in gradient-based optimization. Third, we develop a reduced numerical integration strategy to accelerate the new algorithm. Several numerical examples demonstrate that our method significantly outperforms the current competitive approaches both in terms of robustness and efficiency.