Please use this identifier to cite or link to this item:
Title: Construction of polynomial spline spaces over quadtree and octree T-meshes for its application in isogeometric analysis
Authors: López González, José Iván 
Brovka, Marina 
Escobar Sánchez, José María 
Montenegro Armas, Rafael 
UNESCO Clasification: 1206 Análisis numérico
120407 Geometrías finitas
Keywords: Espacios finitos, mallas octaédricas, análisis isogeométrico
Issue Date: 2017
Conference: International Conference on Finite Elements in Flow Problems (12th. Roma. 2017)
Abstract: We present a new strategy for construction spline spaces over hierarchical T-meshes with quad- and octree subdivision scheme [1]. The proposed method is based on some simple rules for inferring, from a given T-mesh, local knot vectors to define tensor product spline blending functions. A set of cubic spline functions defined by means of this technique span a space with nice properties: it can reproduce cubic polynomials, the functions are C2-continuous, linearly independent, and spaces spanned by nested T-meshes are also nested. In order to define spline spaces with desirable prop- erties applying the proposed rules, the T-mesh should fulfill a mild restriction of being a strongly balanced quadtree or octree. A T-mesh with a quadtree (octree) structure is said to be strongly balanced if any cell has contact (through vertex, edge or face) only with cells that differ at most twice in depth. Balanced tree condition is commonly used in FEM to guarantee a good quality of the approximation space constructed over the mesh. To obtain a strongly balanced quadtree, a standard balancing procedure is applied. The straightforward implementation of the proposed strategy (both in 2D and 3D) and the simplicity of tree structures can make it attractive for its use in geometric design and isogeometric analysis. We give a detailed description of our technique and illustrate some examples of its application in isogeometric analysis performing adaptive re- finement for 2D and 3D problems. Optimal rates of convergence are obtained during adaptive refinement for all test problems. Parameterization of computational domains is obtained using the algorithm described in our previous works [2, 3]. This technique, based on a T-mesh untangling and optimization procedure, allows us to obtain a good quality parameterization from the boundary representation of the geometry. The procedure is an extension of the ideas presented in our works [4, 5].
Source: IACM - 19th International Conference on Finite Elements in Flow Problems (FEF 2017) , Roma, Italia
Appears in Collections:Actas de congresos
Adobe PDF (23,6 kB)
Show full item record

Page view(s)

checked on Sep 10, 2022


checked on Sep 10, 2022

Google ScholarTM



Export metadata

Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.