Merging enriched Finite Element triangle meshes for fast prototyping of alternate solutions in the context of industrial maintenance

  • Authors:

  • Ruding Lou;Jean-Philippe Pernot;Alexei Mikchevitch;Philippe Véron

  • Affiliations:

  • Arts et Métiers ParisTech, LSIS-UMR CNRS 6168, 2, cours des Arts et Métiers, 13617 Aix-en-Provence cedex 1, France;Arts et Métiers ParisTech, LSIS-UMR CNRS 6168, 2, cours des Arts et Métiers, 13617 Aix-en-Provence cedex 1, France;Research and Development Direction, Electricité de France Group, 1, avenue du Général de Gaulle, 92141 Clamart cedex, France;Arts et Métiers ParisTech, LSIS-UMR CNRS 6168, 2, cours des Arts et Métiers, 13617 Aix-en-Provence cedex 1, France

  • Venue:
  • Computer-Aided Design
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

A new approach to the merging of Finite Element (FE) triangle meshes is proposed. Not only it takes into account the geometric aspects, but it also considers the way the semantic information possibly associated to the groups of entities (nodes, faces) can be maintained. Such high level modification capabilities are of major importance in all the engineering activities requiring fast modifications of meshes without going back to the CAD model. This is especially true in the context of industrial maintenance where the engineers often have to solve critical problems in very short time. Indeed, in this case, the product is already designed, the CAD models are not necessarily available and the FE models might be tuned. Thus, the product behaviour has to be studied and improved during its exploitation while prototyping directly several alternate solutions. Such a framework also finds interest in the preliminary design phases where alternative solutions have to be simulated. The algorithm first removes the intersecting faces in an n-ring neighbourhood so that the filling of the created holes produces triangles whose sizes smoothly evolve according to the possibly heterogeneous sizes of the surrounding triangles. The hole-filling algorithm is driven by an aspect ratio factor which ensures that the produced triangulation fits well the FE requirements. It is also constrained by the boundaries of the groups of entities gathering together the simulation semantic. The filled areas are then deformed to blend smoothly with the surroundings meshes.