Idealized models for FEA derived from generative modeling processes based on extrusion primitives

International audienceShape idealization transformations are very common when adapting a CAD component to FEA requirements. Here, an idealization approach is proposed that is based on generative shape processes used to decompose an initial B-Rep object, i.e. extrusion processes. The corresponding primitives form the basis of candidate sub domains for idealization and their connections conveyed through the generative processes they belong to, bring robustness to set up the appropriate connections between idealized sub domains. Taking advantage of an existing construction tree as available in a CAD software does not help much because it may be complicated to use it for idealization processes. Using generative processes attached to an object that are no longer reduced to a single construction tree but to a graph containing all non trivial construction trees, is more useful for the engineer to evaluate variants of idealization. From this automated decomposition, each primitive is analyzed to define whether it can idealized or not. Subsequently, geometric interfaces between primitives are taken into account to determine more precisely the idealizable sub domains and their contours when primitives are incrementally merged to come back to the initial object

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

Extraction of generative processes from B-Rep shapes and application to idealization transformations

International audienceA construction tree is a set of shape generation processes commonly produced with CAD modelers during a design process of B-Rep objects. However, a construction tree does not bring all the desired properties in many configurations: dimension modifications, idealization processes, etc. Generating a non trivial set of generative processes, possibly forming a construction graph, can significantly improve the adequacy of some of these generative processes to meet user's application needs. This paper proposes to extract generative processes from a given B-rep shape as a high-level shape description. To evaluate the usefulness of this description, finite element analyses (FEA) and particularly idealizations are the applications selected to evaluate the adequacy of additive generative processes. Non trivial construction trees containing generic extrusion and revolution primitives behave like well established CSG trees. Advantageously, the proposed approach is primitive-based, which ensures that any generative process of the construction graph does preserve the realizability of the corresponding volume. In the context of FEA, connections between idealized primitives of a construction graph can be efficiently performed using their interfaces. Consequently, generative processes of a construction graph become a high-level object structure that can be tailored to idealizations of primitives and robust connections between them