Preconditioning the Quad Dominant Mesh Generator for Ship Structural Analysis

This paper presents an algorithm for the fully automatic mesh generation for the finite element analysis of ships and offshore structures. The quality requirements on the mesh generator are imposed by the acceptance criteria of the classification societies as well as the need to avoid shear locking when using low degree shell elements. The meshing algorithm will be generating quadrilateral dominated meshes (consisting of quads and triangles) and the mesh quality requirements mandate that quadrilaterals with internal angles close to 90° are to be preferred. The geometry is described by a dictionary containing points, rods, surfaces, and openings. The first part of the proposed method consists of an algorithm to automatically clean the geometry. The corrected geometry is then meshed by the frontal Delaunay mesh generator as implemented in the gmsh package. We present a heuristic method to precondition the cross field of the fronatal quadrilateral mesher. In addition, the influence of the order in which the plates are meshed will be explored as a preconditioning step.

Preconditioning the Quad Dominant Mesh Generator for Ship Structural Analysis

This paper presents an algorithm for the fully automatic mesh generation for the finite element analysis of ships and offshore structures. The quality requirements on the mesh generator are imposed by the acceptance criteria of the classification societies as well as the need to avoid shear locking when using low degree shell elements. The meshing algorithm will be generating quadrilateral dominated meshes (consisting of quads and triangles) and the mesh quality requirements mandate that quadrilaterals with internal angles close to $90\degree$ are to be preferred. The geometry is described by a dictionary containing points, rods, surfaces and openings. The first part of the proposed method consist of an algorithm to automatically clean the geometry. The corrected geometry is then meshed by the frontal Delaunay mesh generator as implemented in the gmsh package. We present a heuristic method to precondition the cross field of the frontal quadrilateral mesher. Also the influence of the order in which the plates are meshed will be explored as a preconditioning step.

simple technique for unstructured mesh generation via adaptive finite elements

This work describes a concise algorithm for the generation of triangular meshes with the help of standard adaptive finite element methods. We demonstrate that a generic adaptive finite element solver can be repurposed into a triangular mesh generator if a robust mesh smoothing algorithm is applied between the mesh refinement steps. We present an implementation of the mesh generator and demonstrate the resulting meshes via examples.

Two-dimensional mesh generator and quality analysis of elements on the curvilinear coordinates system

Through mathematical models, it is possible to turn a problem of the physical domain to the computational domain. In this context, the paper presents a two-dimensional mesh generator in generalized coordinates, which uses the parametric linear spline method and partial differential equations. The generator is automated and able to treat real complex domains and, consequently, more realistic problems. However, there is a possibility that lower quality elements may be introduced into the computational mesh. Thus, metrics are investigated that identify elements considered to be of lower quality. Experiments are carried out to verify the efficiency of the adopted metrics, considering meshes with single block, and multi-blocks. According to the experiments, the work allowed the detection of elements of lower quality, contributing to the realization of an adequate modeling of geometries

A modification of the hexahedral mesh generator based on voxel geometry representation

We consider a modification of the previously developed voxel-based mesh algorithm to generate models given in STL-geometry format. Proposed hexahedral mesh generator belongs to the family of grid methods, and is general-purpose in terms of a capability to use as source data both volume (voxel) and STL-surface representation of model geometry. For now, the algorithm works with CAD models described in the well-known STL format. However, it also allows to handle higher-order surface patches defined in an arbitrary format if appropriate procedures for projection and intersection operations will be specified. To define the initial position of mesh nodes, a “signed distance field” volume data file, obtained from the STL-geometry, is used. A special projection technique was developed to adapt constructed orthogonal mesh on the model's boundary. It provides an approximation of sharp edges and corners and is performed before running any other operations with the mesh. Finally, to improve the quality of the mesh, additional procedures were implemented, including boundary layers insertion, bad quality cells splitting, and optimization-based smoothing technique. The algorithm has been tested on a sufficient number of models, some of which are given as examples.