.png){kind=icon}
.png){kind=icon}
Return
A finite element framework based on bivariate simplex splines on triangle configurations
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cma.2019.112598.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Recently, triangle configuration based bivariate simplex splines (referred to as TCB-spline) have been introduced to the geometric computing community. TCB-splines retain many attractive theoretic properties of classical B-splines, such as partition of unity, local support, polynomial reproduction and automatic inbuilt high-order smoothness. In this paper, we propose a computational framework for isogeometric analysis using TCB-splines. The centroidal Voronoi tessellation method is used to generate a set of knots that are distributed evenly over the domain. Then, knot subsets are carefully selected by a so-called link triangulation procedure (LTP), on which shape functions are defined in a recursive manner. To achieve high-precision numerical integration, triangle faces served as background integration cells are obtained by triangulating the entire domain restricted to all knot lines, i.e., line segments defined by any two knots in a knot subset. Various numerical examples are carried out to demonstrate the efficiency, flexibility and optimal convergence rates of the proposed method. (C) 2019 Elsevier B.V. All rights reserved.
Keywords:
Simplex spline
TCB-splines
Isogeometric analysis
Triangulation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.3
Papers:
1.3W
Citations:
5.6W