Analysis-suitable adaptive T-mesh refinement with linear complexity

From MaRDI portal
Publication:2409708



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.





Cited in
(34)








This page was built for publication: Analysis-suitable adaptive T-mesh refinement with linear complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2409708)