Generalizing the advancing front method to composite surfaces in the context of meshing constraints topology

International audienceBeing able to automatically mesh composite geometry is an important issue in the context of CAD-FEA integration. In some specific contexts of this integration, such as using virtual topology or meshing constraints topology (MCT), it is even a key requirement. In this paper, we present a new approach to automatic mesh generation over composite geometry. The proposed mesh generation approach is based on a generalization of the advancing front method (AFM) over curved surfaces. The adaptation of the AFM to composite faces (composed of multiple boundary representation (B-Rep) faces) involves the computation of complex paths along these B-Rep faces, on which progression of the advancing front is based. Each mesh segment or mesh triangle generated through this progression on composite geometry is likely to lie on multiple B-Rep faces and consequently, it is likely to be associated with a composite definition across multiple parametric spaces. Collision tests between new front segments and existing mesh elements also require specific and significant adaptations of the AFM, since a given front segment is also likely to lie on multiple B-Rep faces. This new mesh generation approach is presented in the context of MCT, which requires being able to handle composite geometry along with non-manifold boundary configurations, such as edges and vertices lying in the interior domain of B-Rep faces

FE modelling of a structurally stitched multilayer composite

Finite-element models are presented for a typical structurally stitched carbonfibre composite. The term 'structural' means that the stitching yarn is thick enough to form a through-the-thickness reinforcement. The influences of different model features are revealed. The stitching, on the one hand, is shown to increase the stiffness, especially its out-plane component. On the other hand, it creates prominent stress-strain concentrators

Theory and applications of bijective barycentric mappings

Barycentric coordinates provide a convenient way to represent a point inside a triangle as a convex combination of the triangle's vertices, and to linearly interpolate data given at these vertices. Due to their favourable properties, they are commonly applied in geometric modelling, finite element methods, computer graphics, and many other fields. In some of these applications it is desirable to extend the concept of barycentric coordinates from triangles to polygons. Several variants of such generalized barycentric coordinates have been proposed in recent years. An important application of barycentric coordinates consists of barycentric mappings, which allow to naturally warp a source polygon to a corresponding target polygon, or more generally, to create mappings between closed curves or polyhedra. The principal practical application is image warping, which takes as input a control polygon drawn around an image and smoothly warps the image by moving the polygon vertices. A required property of image warping is to avoid fold-overs in the resulting image. The problem of fold-overs is a manifestation of a larger problem related to the lack of bijectivity of the barycentric mapping. Unfortunately, bijectivity of such barycentric mappings can only be guaranteed for the special case of warping between convex polygons or by triangulating the domain and hence renouncing smoothness. In fact, for any barycentric coordinates, it is always possible to construct a pair of polygons such that the barycentric mapping is not bijective. In the first part of this thesis we illustrate three methods to achieve bijective mappings. The first method is based on the intuition that, if two polygons are sufficiently close, then the mapping is close to the identity and hence bijective. This suggests to ``split'' the mapping into several intermediate mappings and to create a composite barycentric mapping which is guaranteed to be bijective between arbitrary polygons, polyhedra, or closed planar curves. We provide theoretical bounds on the bijectivity of the composite mapping related to the norm of the gradient of the coordinates. The fact that the bound depends on the gradient implies that these bounds exist only if the gradient of the coordinates is bounded. We focus on mean value coordinates and analyse the behaviour of their directional derivatives and gradient at the vertices of a polygon. The composition of barycentric mappings for closed planar curves leads to the problem of blending between two planar curves. We suggest to solve it by linearly interpolating the signed curvature and then reconstructing the intermediate curve from the interpolated curvature values. However, when both input curves are closed, this strategy can lead to open intermediate curves. We present a new algorithm for solving this problem, which finds the closed curve whose curvature is closest to the interpolated values. Our method relies on the definition of a suitable metric for measuring the distance between two planar curves and an appropriate discretization of the signed curvature functions. The second method to construct smooth bijective mappings with prescribed behaviour along the domain boundary exploits the properties of harmonic maps. These maps can be approximated in different ways, and we discuss their respective advantages and disadvantages. We further present a simple procedure for reducing their distortion and demonstrate the effectiveness of our approach by providing examples. The last method relies on a reformulation of complex barycentric mappings, which allows us to modify the ``speed'' along the edges to create complex bijective mappings. We provide some initial results and an optimization procedure which creates complex bijective maps. In the second part we provide two main applications of bijective mapping. The first one is in the context of finite elements simulations, where the discretization of the computational domain plays a central role. In the standard discretization, the domain is triangulated with a mesh and its boundary is approximated by a polygon. We present an approach which combines parametric finite elements with smooth bijective mappings, leaving the choice of approximation spaces free. This approach allows to represent arbitrarily complex geometries on coarse meshes with curved edges, regardless of the domain boundary complexity. The main idea is to use a bijective mapping for automatically warping the volume of a simple parametrization domain to the complex computational domain, thus creating a curved mesh of the latter. The second application addresses the meshing problem and the possibility to solve finite element simulations on polygonal meshes. In this context we present several methods to discretize the bijective mapping to create polygonal and piece-wise polynomial meshes

Finite element analysis based on a parametric model by approximating point clouds

Simplified models are widely applied in finite element computations regarding mechanical and structural problems. However, the simplified model sometimes causes many deviations in the finite element analysis (FEA) of structures, especially in the non-designed structures which have undergone unknowable deformation features. Hence, a novel FEA methodology based on the parametric model by approximating three-dimensional (3D) feature data is proposed to solve this problem in the present manuscript. Many significant anci effective technologies have been developeci to detect 3D feature information accurately, e.g., terrestrial laser scanning (TLS), digital photogrammetry, and radar technology. In this manuscript, the parametric FEA model combines 3D point clouds from TLS and the parametric surface approximation method to generate 3D surfaces and models accurately. TLS is a popular measurement method for reliable 3D point clouds acquisition and monitoring deformations of structures with high accuracy and precision. The B-spline method is applied to approximate the measured point clouds data automatically and generate a parametric description of the structure accurately. The final target is to reduce the effects of the model description and deviations of the FEA. Both static and dynamic computations regarding a composite structure are carried out by comparing the parametric and general simplified models. The comparison of the deformation and equivalent stress of future behaviors are reflected by different models. Results indicate that the parametric model based on the TLS data is superior in the finite element computation. Therefore, it is of great significance to apply the parametric model in the FEA to compute and predict the future behavior of the structures with unknowable deformations in engineering accurately

An interactive geometry modeling and parametric design platform for isogeometric analysis

In this paper an interactive parametric design-through-analysis platform is proposed to help design engineers and analysts make more effective use of Isogeometric Analysis (IGA) to improve their product design and performance. We develop several Rhinoceros (Rhino) plug-ins to take input design parameters through a user-friendly interface, generate appropriate surface and/or volumetric models, perform mechanical analysis, and visualize the solution fields, all within the same Computer-Aided Design (CAD) program. As part of this effort we propose and implement graphical generative algorithms for IGA model creation and visualization based on Grasshopper, a visual programming interface to Rhino. The developed platform is demonstrated on two structural mechanics examples—an actual wind turbine blade and a model of an integrally bladed rotor (IBR). In the latter example we demonstrate how the Rhino functionality may be utilized to create conforming volumetric models for IGA