Analysis-suitable adaptive T-mesh refinement with linear complexity
classification
🧮 math.NA
cs.NA
keywords
linearrefinementadaptiveanalysis-suitabilitycomplexitygeneratedproceduret-mesh
read the original abstract
We present an efficient adaptive refinement procedure that preserves analysis-suitability of the T-mesh, this 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.