Penalty function-based volumetric parameterization method for isogeometric analysis

Journal article (2022)

Authors

Y. Ji Dalian University of Technology, Key Laboratory for Computational Mathematics and Data Intelligence of Liaoning Province
Meng-Yun Wang Dalian University of Technology, Key Laboratory for Computational Mathematics and Data Intelligence of Liaoning Province
Dong-Jie Pan Key Laboratory of Mathematical Modelling and High Performance Computing of Air Vehicles, Nanjing University of Aeronautics and Astronautics
Yi Zhang Dalian University of Technology, Key Laboratory for Computational Mathematics and Data Intelligence of Liaoning Province
G Zhu Key Laboratory for Computational Mathematics and Data Intelligence of Liaoning Province, Dalian University of Technology
Affiliation
External organisation
More Info
expand_more

Published Date

2022-3

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Affiliation

External organisation

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.