Abstract In this paper, we propose a general framework for constructing IGA-suitable planar B-spline parameterizations from given complex CAD boundaries. Instead of the computational domain bounded by four B-spline curves, planar domains with high genus and more complex boundary curves are considered. Firstly, some pre-processing operations including Bezier extraction and subdivision are performed on each boundary curve in order to generate a high-quality planar parameterization; then a robust planar domain partition framework is proposed to construct high-quality patch-meshing results with few singularities from the discrete boundary formed by connecting the end points of the resulting boundary segments. After the topology information generation of quadrilateral decomposition, the optimal placement of interior Bezier curves corresponding to the interior edges of the quadrangulation is constructed by a global optimization method to achieve a patch-partition with high quality. Finally, after the imposition of C 1 ∕ G 1 -continuity constraints on the interface of neighboring Bezier patches with respect to each quad in the quadrangulation, the high-quality Bezier patch parameterization is obtained by a local optimization method to achieve uniform and orthogonal iso-parametric structures while keeping the continuity conditions between patches. The efficiency and robustness of the proposed method are demonstrated by several examples which are compared to results obtained by the skeleton-based parameterization approach.
The use of trivariate NURBS in isogeometric analysis has put the quality of parametrization of NURBS volumes on the agenda. Sometimes a NURBS volume needs a better parametrization to meet requirements regarding smoothness, approximation or periodicity. In this paper we generalize various smoothing methods that already exist for bivariate parametric spline surfaces to trivariate parametric spline volumes. We will also address how rational and polynomial spline volumes create different challenges and solutions in the algorithms. Volumetric spline parameterization and computational efficiency are two main challenges in isogeometric analysis (IGA). To tackle this problem, we propose a framework of computation reuse in IGA on a set of three-dimensional models with similar semantic features. Given a template domain, B-spline based consistent volumetric parameterization is first constructed for a set of models with similar semantic features. An efficient quadrature-free method is investigated in our framework to compute the entries of stiffness matrix by Bezier extraction and polynomial approximation. In our approach, evaluation on the stiffness matrix and imposition of the boundary conditions can be pre-computed and reused during IGA on a set of CAD models. Examples with complex geometry are presented to show the effectiveness of our methods, and efficiency similar to the computation in linear finite element analysis can be achieved for IGA taken on a set of models. Trivariate NURBS (non-uniform rational B-splines) representation of composite panels which is suitable for three-dimensional isogeometric analysis (IGA) is constructed with a new curve surface offset algorithm. The proposed offset algorithm, which is required by IGA, is non-existent in the CAD literature. Using the presented approach, finite element analysis of composite panels can be performed with the only input being the geometry representation of the composite surface. The method proposed provides a bi-directional system in which one can go forward from CAD to analysis and backwards from analysis to CAD. This is believed to facilitate the design of composite structures. Different parts (patches) can be parametrized independently of each other and glued together, in the finite element solver, by a discontinuous Galerkin method. A stress analysis of curved composite panel with stiffeners is provided to demonstrate the proposed framework. In isogeometric analysis, parameterization of computational domain has great effects as mesh generation in finite element analysis. In this paper, based on the concept of harmonic mapping from the computational domain to parametric domain, a variational harmonic approach is proposed to construct analysis-suitable parameterization of computational domain from CAD boundary for 2D and 3D isogeometric applications. Different from the previous elliptic mesh generation method in finite element analysis, the proposed method focuses on isogeometric version, and converts the elliptic PDE into a nonlinear optimization problem, in which a regular term is integrated into the optimization formulation to achieve more uniform and orthogonal iso-parametric structure near convex (concave) parts of the boundary. Several examples are presented to show the efficiency of the proposed method in 2D and 3D isogeometric analysis. Isogeometric Analysis uses NURBS representations of the domain for performing numerical simulations. The first part of this paper presents a variational framework for generating NURBS parameterizations of swept volumes. The class of these volumes covers a number of interesting free-form shapes, such as blades of turbines and propellers, ship hulls or wings of airplanes. The second part of the paper reports the results of isogeometric analysis which were obtained with the help of the generated NURBS volume parameterizations. In particular we discuss the influence of the chosen parameterization and the incorporation of boundary conditions. To achieve a tight integration of design and analysis, conformal solid T-spline construction with the input boundary spline representation preserved is desirable. However, to the best of our knowledge, this is still an open problem. In this paper, we provide its first solution. The input boundary T-spline surface has genus-zero topology and only contains eight extraordinary nodes, with an isoparametric line connecting each pair. One cube is adopted as the parametric domain for the solid T-spline. Starting from the cube with all the nodes on the input surface as T-junctions, we adaptively subdivide the domain based on the octree structure until each face or edge contains at most one face T-junction or one edge T-junction. Next, we insert two boundary layers between the input T-spline surface and the boundary of the subdivision result. Finally, knot intervals are calculated from the T-mesh and the solid T-spline is constructed. The obtained T-spline is conformal to the input T-spline surface with exactly the same boundary representation and continuity. For the interior region, the continuity is C 2 everywhere except for the local region surrounding irregular nodes. Several examples are presented to demonstrate the performance of the algorithm. Parameterization of the computational domain is a key step in isogeometric analysis just as mesh generation is in finite element analysis. In this paper, we study the volume parameterization problem of the multi-block computational domain in an isogeometric version, i.e., how to generate analysis-suitable parameterization of the multi-block computational domain bounded by B-spline surfaces. Firstly, we show how to find good volume parameterization of the single-block computational domain by solving a constraint optimization problem, in which the constraint condition is the injectivity sufficient conditions of B-spline volume parameterization, and the optimization term is the minimization of quadratic energy functions related to the first and second derivatives of B-spline volume parameterization. By using this method, the resulting volume parameterization has no self-intersections, and the isoparametric structure has good uniformity and orthogonality. Then we extend this method to the multi-block case, in which the continuity condition between the neighbor B-spline volumes should be added to the constraint term. The effectiveness of the proposed method is illustrated by several examples based on the three-dimensional heat conduction problem. High-quality volumetric parameterization of computational domain plays an important role in three-dimensional isogeometric analysis. Reparameterization technique can improve the distribution of isoparametric curves surfaces without changing the geometry. In this paper, using the reparameterization method, we investigate the high-quality construction of analysis-suitable NURBS volumetric parameterization. Firstly, we introduce the concept of volumetric reparameterization, and propose an optimal Mobius transformation to improve the quality of the isoparametric structure based on a new uniformity metric. Secondly, from given boundary NURBS surfaces, we present a two-stage scheme to construct the analysis-suitable volumetric parameterization: in the first step, uniformity-improved reparameterization is performed on the boundary surfaces to achieve high-quality isoparametric structure without changing the shape; in the second step, from a new variational harmonic metric and the reparameterized boundary surfaces, we construct the optimal inner control points and weights to achieve an analysis-suitable NURBS solid. Several examples with complicated geometry are presented to illustrate the effectiveness of proposed methods. In this paper, we present an approach that automatically constructs a trivariate tensor-product B-spline solid via a gradient-based optimization approach. Given six boundary B-spline surfaces for a solid, this approach finds the internal control points so that the resulting trivariate B-spline solid is valid in the sense the minimal Jacobian of the solid is positive. It further minimizes a volumetric functional to improve resulting parametrization quality. For a trivariate B-spline solid even with moderate shape complexity, direct optimization of the Jacobian of the B-spline solid is computationally prohibitive since it would involve thousands of design variables and hundreds of thousands of constraints. We developed several techniques to address this challenge. First, we develop initialization methods that can rapidly generate initial parametrization that are valid or near-valid. We then use a divide-and-conquer approach to partition the large optimization problem into a set of separable sub-problems. For each sub-problem, we group the B-spline coefficients of the Jacobian determinant into different blocks and make one constraint for each block of coefficients. This is achieved by taking an aggregate function, the Kreisselmeier-Steinhauser function value of the elements in each block. With block aggregation, it reduces the dimension of the problem dramatically. In order to further reduce the computing time at each iteration, a hierarchical optimization approach is used where the input boundary surfaces are coarsened to difference levels. We optimize the distribution of internal control points for the coarse representation first, then use the result as initial parametrization for optimization at the next level. The resulting parametrization can then be further optimized to improve the mesh quality. Optimized trivariate parametrization from various boundary surfaces and the corresponding parametrization metric are given to illustrate the effectiveness of the approach.