Abstract
AbstractMultivariate basis splines (B‐splines) and Non‐uniform rational B‐splines (NURBS) lack adaptivity due to their tensor product structure. Truncated hierarchical B‐splines (THB‐splines) provide a solution for this. THB‐splines organize the parameter space into a hierarchical structure, which enables efficient approximation and representation of functions with different levels of detail. The truncation mechanism ensures the partition of unity property of B‐splines and defines a more scattered set of basis functions without overlapping on the multi‐level spline space. Transferring these multi‐level splines into Bézier elements representation facilitates straightforward incorporation into existing finite element (FE) codes. By separating the multi‐level extraction of the THB‐splines from the standard Bézier extraction, a more general independent framework applicable to any sequence of nested spaces is created. The operators for the multi‐level structure of THB‐splines and the operators of Bézier extraction are constructed in a local approach. Adjusting the operators for the multi‐level structure from an element point of view and multiplying with the Bézier extraction operators of those elements, a direct map between Bézier elements and a hierarchical structure is obtained. The presented implementation involves the use of an open‐source Octave/MATLAB isogeometric analysis (IGA) code called GeoPDEs. A basic Poisson problem is presented to investigate the performance of multi‐level Bézier extraction compared to a standard THB‐spline approach.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.