Analysis-suitable adaptive T-mesh refinement with linear complexity

We present an efficient adaptive refinement procedure that preserves analysis-suitability of the T-mesh, that is, the linear independence of the T-spline blending functions. We prove analysis-suitability of the overlays and boundedness of their cardinalities, nestedness of the generated T-spline spa...

Full description

Saved in:
Bibliographic Details
Published in:Computer aided geometric design 2015-03, Vol.34, p.50-66
Main Authors: Morgenstern, Philipp, Peterseim, Daniel
Format: Article
Language:English
Subjects:
Adaptive mesh refinement
Analysis-suitability
Isogeometric analysis
Nestedness
T-splines
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present an efficient adaptive refinement procedure that preserves analysis-suitability of the T-mesh, that is, the linear independence of the T-spline blending functions. We prove analysis-suitability of the overlays and boundedness of their cardinalities, nestedness of the generated T-spline spaces, and linear computational complexity of the refinement procedure in terms of the number of marked and generated mesh elements. •We present a new algorithm for the adaptive refinement of T-meshes.•The algorithm preserves Analysis-Suitability and produces nested T-spline spaces.•Any two generated meshes have an analysis-suitable overlay.•We prove linear complexity of the refinement algorithm.
ISSN:0167-8396
1879-2332
DOI:10.1016/j.cagd.2015.02.003