6 research outputs found

    Exact conversion from BĂ©zier tetrahedra to BĂ©zier hexahedra

    Get PDF
    International audienceModeling and computing of trivariate parametric volumes is an important research topic in the field of three-dimensional isogeo-metric analysis. In this paper, we propose two kinds of exact conversion approaches from BĂ©zier tetrahedra to BĂ©zier hexahedra with the same degree by reparametrization technique. In the first method, a BĂ©zier tetrahedron is converted into a degenerate BĂ©zier hexahedron, and in the second approach, a non-degenerate BĂ©zier tetrahedron is converted into four non-degenerate BĂ©zier hexahedra. For the proposed methods, explicit formulas are given to compute the control points of the resulting tensor-product BĂ©zier hexahedra. Furthermore, in the second method, we prove that tetrahedral spline solids with C k-continuity can be converted into a set of tensor-product BĂ©zier volumes with G k-continuity. The proposed methods can be used for the volumetric data exchange problems between different trivariate spline representations in CAD/CAE. Several experimental results are presented to show the effectiveness of the proposed methods

    Constructing IGA-suitable planar parameterization from complex CAD boundary by domain partition and global/local optimization

    Get PDF
    In this paper, we propose a general framework for constructing IGA-suitable planar B-spline parameterizations from given complex CAD boundaries consisting of a set of B-spline curves. Instead of forming the computational domain by a simple boundary, planar domains with high genus and more complex boundary curves are considered. Firstly, some pre-processing operations including B\'ezier 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 B\'ezier 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 C1=G1-continuity constraints on the interface of neighboring B\'ezier patches with respect to each quad in the quadrangulation, the high-quality B\'ezier patch parameterization is obtained by a C1-constrained 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

    Adaptive isogeometric analysis with hierarchical box splines

    Get PDF
    Isogeometric analysis is a recently developed framework based on finite element analysis, where the simple building blocks in geometry and solution space are replaced by more complex and geometrically-oriented compounds. Box splines are an established tool to model complex geometry, and form an intermediate approach between classical tensor-product B-splines and splines over triangulations. Local refinement can be achieved by considering hierarchically nested sequences of box spline spaces. Since box splines do not offer special elements to impose boundary conditions for the numerical solution of partial differential equations (PDEs), we discuss a weak treatment of such boundary conditions. Along the domain boundary, an appropriate domain strip is introduced to enforce the boundary conditions in a weak sense. The thickness of the strip is adaptively defined in order to avoid unnecessary computations. Numerical examples show the optimal convergence rate of box splines and their hierarchical variants for the solution of PDEs

    Optimizing domain parameterization in isogeometric analysis based on Powell-Sabin splines

    No full text
    We address the problem of constructing a high-quality parameterization of a given planar physical domain, defined by means of a finite set of boundary curves. We look for a geometry map represented in terms of Powell-Sabin B-splines. Powell-Sabin splines are C1 quadratic splines defined on a triangulation, and thus the parameter domain can be any polygon. The geometry map is generated by the following three-step procedure. First, the shape of the parameter domain and a corresponding triangulation are determined, in such a way that its number of corners matches the number of corners of the physical domain. Second, the boundary control points related to the Powell-Sabin B-spline representation are chosen so that they parameterize the boundary curve of the physical domain. Third, the remaining inner control points are obtained by solving a nimble optimization problem based on the Winslow functional. The proposed domain parameterization procedure is illustrated numerically in the context of isogeometric Galerkin discretizations based on Powell-Sabin splines. It turns out that the flexibility rising from the generality of the parameter domain has a beneficial effect on the quality of the parameterization and also on the accuracy of the computed approximate solution
    corecore