Refinement algorithms for adaptive isogeometric methods with hierarchical splines

35Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

The construction of suitable mesh configurations for spline models that provide local refinement capabilities is one of the fundamental components for the analysis and development of adaptive isogeometric methods. We investigate the design and implementation of refinement algorithms for hierarchical B-spline spaces that enable the construction of locally graded meshes. The refinement rules properly control the interaction of basis functions at different refinement levels. This guarantees a bounded number of nonvanishing (truncated) hierarchical B-splines on any mesh element. The performances of the algorithms are validated with standard benchmark problems.

Cite

CITATION STYLE

APA

Bracco, C., Giannelli, C., & Vázquez, R. (2018). Refinement algorithms for adaptive isogeometric methods with hierarchical splines. Axioms, 7(3). https://doi.org/10.3390/axioms7030043

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free