Elliptic grid generation techniques in the framework of isogeometric analysis applications

Research output: Contribution to journalArticleScientificpeer-review

7 Citations (Scopus)
10 Downloads (Pure)

Abstract

The generation of an analysis-suitable computational grid from a description of no more than its boundaries is a common problem in numerical analysis. Most classical meshing techniques for finite-volume, finite-difference or finite-element applications such as the Advancing Front Method (Schöberl, 1997), Delaunay Triangulation (Triangle, 1996) and elliptic or hyperbolic meshing schemes (Thompson et al., 1998) operate with linear or multi-linear but straight-sided elements for the generation of structured and unstructured meshes, respectively, whereas the generation of high-quality curved meshes is still considered a major challenge. A recent development is the introduction of Isogeometric Analysis (IgA) (Hughes et al., 2005), which can be considered as a natural high-order generalisation of the finite-element method. A description of the geometry Ω¯ is accomplished via a mapping operator x:Ωˆ→Ω that maps the unit hypercube in Rn onto an approximation Ω of Ω¯ utilizing a linear combination of higher-order spline functions. The numerical simulation is then carried out in the computational domain Ωˆ via a ‘pull back’ using the mapping operator x. The advantage is that the flexibility of higher-order spline-functions usually allows for an accurate description of Ω¯ with much fewer elements which can significantly reduce the computational effort required for this step compared to traditional low-order methods. Furthermore, an analytical description of the geometry can be turned back into a traditional (structured or unstructured) grid by performing a large number of function evaluations in x. This can, for instance, be utilized for local refinement without the need for remeshing. A potential drawback of curved instead of linear elements is that the meshing techniques required for the creation of folding-free mappings tend to be more sophisticated and that it is a less trivial task to verify that the resulting mapping is indeed bijective. For the purpose of creating folding-free mappings utilizing spline-functions, we will present an algorithm adopting the principles of Elliptic Grid Generation (EGG) whose basic principles have been adapted to meet the needs of IgA. In R2, EGG has particularly appealing properties since bijectivity of the resulting mapping is guaranteed as long as the numerical accuracy to the computational approach of the mapping is sufficient. We will present an algorithm that is capable of generating folding-free mappings from a large number of geometry contours, including complicated geometries from industrial applications with extreme aspect ratios. This is accomplished by combining EGG with automatized reparameterization techniques and a sophisticated numerical approach for solving resulting governing (nonlinear) equations. The algorithm is equipped with the means to verify the bijectivity of the resulting mapping and with automatized defect-correction methods in case a violation of bijectivity is detected. Furthermore, we will present possible strategies for the generation of folding-free mappings for certain types of volumetric geometries by combining EGG with transfinite-interpolation as well as a number of other applications such as time-dependent settings. All applications are provided with example geometries.

Original languageEnglish
Pages (from-to)48-75
Number of pages28
JournalComputer Aided Geometric Design
Volume65
DOIs
Publication statusPublished - 2018

Fingerprint Dive into the research topics of 'Elliptic grid generation techniques in the framework of isogeometric analysis applications'. Together they form a unique fingerprint.

Cite this