Please use this identifier to cite or link to this item: http://hdl.handle.net/10553/16442
Title: A simple strategy for defining polynomial spline spaces over hierarchical T-meses
Authors: Brovka, Marina 
López, J. I. 
Escobar Sánchez, José María 
Montenegro Armas, Rafael 
Cascón Barbero, José Manuel
UNESCO Clasification: 1204 Geometría
1206 Análisis numérico
Keywords: Isogeometric analysis
Multivariate splines
Local refinement
T-mesh
Nested spaces
Issue Date: 2016
Project: Avances en Simulación de Campos de Viento y Radiación Solar. 
Journal: Computer Aided Design 
Abstract: We present a new strategy for constructing spline spaces over hierarchical T-meshes with quad- and octree subdivision schemes. The proposed technique includes some simple rules for inferring local knot vectors to define -continuous cubic tensor product spline blending functions. Our conjecture is that these rules allow to obtain, for a given T-mesh, a set of linearly independent spline functions with the property that spaces spanned by nested T-meshes are also nested, and therefore, the functions can reproduce cubic polynomials. In order to span spaces with these properties applying the proposed rules, the T-mesh should fulfill the only requirement of being a 0-balanced mesh. The straightforward implementation of the proposed strategy can make it an attractive tool for its use in geometric design and isogeometric analysis. In this paper we give a detailed description of our technique and illustrate some examples of its application in isogeometric analysis performing adaptive refinement for 2D and 3D problems.
URI: http://hdl.handle.net/10553/16442
ISSN: 0010-4485
DOI: 10.1016/j.cad.2015.06.008
Source: Computer Aided Design [ISSN 0010-4485], v. 72, p. 140-156
Rights: by-nc-nd
Appears in Collections:Artículos
Thumbnail
Adobe PDF (13,02 MB)
Show full item record

Page view(s)

21
checked on Feb 21, 2021

Download(s)

63
checked on Feb 21, 2021

Google ScholarTM

Check

Altmetric


Share



Export metadata



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