As a remarkable difference to the existing CAD technology, where shapes are represented by their boundaries, FEM-based isogeometric analysis typically needs a parameterization of the interior of the ...domain. Due to the strong influence on the accuracy of the analysis, methods for constructing a good parameterization are fundamentally important. The flexibility of single patch representations is often insufficient, especially when more complex geometric shapes have to be represented. Using a multi-patch structure may help to overcome this challenge.
In this paper we present a systematic method for exploring the different possible parameterizations of a planar domain by collections of quadrilateral patches. Given a domain, which is represented by a certain number of boundary curves, our aim is to find the optimal multi-patch parameterization with respect to an objective function that captures the parameterization quality. The optimization considers both the location of the control points and the layout of the multi-patch structure. The latter information is captured by pre-computed catalogs of all available multi-patch topologies. Several numerical examples demonstrate the performance of the method.
•A method for finding a multi-patch parameterization for a domain is presented.•The control points as well as the layout of the multi-patch structure are considered.•Pre-computed catalogs of all available multi-patch topologies are used.
We generate a basis of the space of bicubic and biquartic C1-smooth geometrically continuous isogeometric functions on bilinear multi-patch domains Ω⊂R2. The basis functions are obtained by suitably ...combining C1-smooth geometrically continuous isogeometric functions on bilinearly parameterized two-patch domains (cf. 18). They are described by simple explicit formulas for their spline coefficients.
These C1-smooth isogeometric functions possess potential for applications in isogeometric analysis, which is demonstrated by several examples (such as the biharmonic equation). In particular, the numerical results indicate optimal approximation power.
•Construction of a basis for bicubic and biquartic C1-smooth isogeometric functions on planar bilinear multi-patch domains.•The basis functions are described by simple explicit formulas for their spline coefficients.•Numerical experiments (e.g. solving the biharmonic equation) showed optimal rates of convergence.
A spline space suitable for Isogeometric Analysis (IgA) on multi-patch domains is presented. Our construction is motivated by emerging requirements in isogeometric simulations. In particular, IgA ...spaces should allow for adaptive mesh refinement and they should guarantee the optimal smoothness of the discretized solution, even across interfaces of adjacent patches.
Given a domain manifold M consisting of individual patches (isomorphic to the unit square or cube) that are glued together along interfaces, we present a construction of multi-patch B-splines defined on them. Their smoothness is enhanced by locally modifying or merging basis functions around the boundary of each patch. The resulting multi-patch B-splines with enhanced smoothness (MPBES) possess the property of local linear independence and form a non-negative partition of unity. Moreover, their span can be characterized as the linear space of all piecewise polynomial functions on the domain manifold that possess certain smoothness properties.
Subsequently, adaptively refined MPBES are obtained by generalizing the construction of truncated hierarchical (TH) B-splines. More precisely, a nested sequence of spaces spanned by MPBES is considered, corresponding to steps of local enrichment. In addition, an inversely nested sequence of subdomains (which are submanifolds of M) is used to specify the local refinement level of functions in these spaces. Finally, truncated hierarchical MPBES are obtained by means of the selection and truncation mechanism of THB-splines. The desired properties of linear independence and convex partition of unity are maintained.
The paper presents several numerical examples which demonstrate potential applications of the new basis in isogeometric analysis.
Display omitted
•Method for regularization of a medial axis of a planar domain.•Boundary curve of domain is smoothed by a new fairing method.•Fairing is based on total variation regularization.
We ...present a new fairing method for planar curves, which is particularly well suited for the regularization of the medial axis of a planar domain. It is based on the concept of total variation regularization. The original boundary (given as a closed B-spline curve or several such curves for multiply connected domains) is approximated by another curve that possesses a smaller number of curvature extrema. Consequently, the modified curve leads to a smaller number of branches of the medial axis. In order to compute the medial axis, we use the state-of-the-art algorithm from 1 which is based on arc spline approximation and a domain decomposition approach. We improve this algorithm by using a different decomposition strategy that allows to reduce the number of base cases from 13 to only 5. Moreover, the algorithm reduces the number of conic arcs in the output by approx. 50%.