Optimal analysis-aware parameterization of computational domain in 3D isogeometric analysis

  • Authors:
  • Gang Xu;Bernard Mourrain;RéGis Duvigneau;André Galligo

  • Affiliations:
  • College of Computer Science, Hangzhou Dianzi University, Hangzhou 310018, PR China and Galaad, INRIA Sophia-Antipolis, 2004 Route des Lucioles, 06902 Cedex, France;Galaad, INRIA Sophia-Antipolis, 2004 Route des Lucioles, 06902 Cedex, France;OPALE, INRIA Sophia-Antipolis, 2004 Route des Lucioles, 06902 Cedex, France;University of Nice Sophia-Antipolis, 06108 Nice Cedex 02, France

  • Venue:
  • Computer-Aided Design
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

In the isogeometric analysis framework, a computational domain is exactly described using the same representation as the one employed in the CAD process. For a CAD object, various computational domains can be constructed with the same shape but with different parameterizations; however one basic requirement is that the resulting parameterization should have no self-intersections. Moreover we will show, with an example of a 3D thermal conduction problem, that different parameterizations of a computational domain have different impacts on the simulation results and efficiency in isogeometric analysis. In this paper, a linear and easy-to-check sufficient condition for the injectivity of a trivariate B-spline parameterization is proposed. For problems with exact solutions, we will describe a shape optimization method to obtain an optimal parameterization of a computational domain. The proposed injective condition is used to check the injectivity of the initial trivariate B-spline parameterization constructed by discrete Coons volume method, which is a generalization of the discrete Coons patch method. Several examples and comparisons are presented to show the effectiveness of the proposed method. During the refinement step, the optimal parameterization can achieve the same accuracy as the initial parameterization but with less degrees of freedom.