• Transactions of the Korean Society of Mechanical Engineers
• /
• v.18 no.11
• /
• pp.2932-2943
• /
• 1994

An efficient approach to the automatic construction of effective quadrilateral finite element meshes for two-dimensional analysis is presented. The procedure is composed of, firstly, an initial mesh generation and, secondly, an h-version of adaptive refinement based on error analysis. As for an initial mesh generation scheme, a modified looping algorithm has been employed. For the adaptive refinement process, an error indicator obtained by computing the residual error of the equilibrium equations in the energy norm with a relaxation factor has been employed. Examples of mesh generation and self-adaptive mesh improvements are given. These example solutions demonstrate that an effective mesh for a given error tolerance can be obtained in a few steps of the analysis processes.

• Transactions of Materials Processing
• /
• v.12 no.3
• /
• pp.194-201
• /
• 2003

An automatic quadrilateral mesh generator for large deformation finite element analysis such as metal forming simulation was developed. The NURBS interpolation method is used for modeling arbitrary 2-D free surface. This mesh generation technique is the modified paving algorithm, which is an advancing front technique with element-by-element resolving method for paving boundary intersection problem. The mesh density for higher analysis accuracy and less analysis time can be easily controlled with high-density points, maximum and minimum element size. A couple of application to large deformation finite element analysis is given as an example, which shows versatility and applicability of the proposed approach and the developed mesh generator for large deformation finite element analysis.

• Korean Journal of Computational Design and Engineering
• /
• v.8 no.1
• /
• pp.10-18
• /
• 2003

FEM (Finite Element Method) is a fundamental numerical analysis technique in wide spread use in engineering application. As the solving time occupies small portion of entire FEM analysis time because of development of hardware, the relative lime to the whole analysis time to make mesh mod-els is growing. In particular, in the case of stiffeners such as features attached to plate in ship structure, the line constraints are imposed on mesh model together with other constraints such as holes. To auto-matically generate two dimensional quadrilateral mesh with the line constraints, an algorithm is pro-posed based on the constrained Delaunay triangulation and Q-Morph algorithm in which the line constraints are not considered. The performance of the proposed algorithm is evaluated. And some numerical results of our proposed algorithm ate presented.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.2
• /
• pp.153-161
• /
• 1999

An atomatic mesh generation scheme with unstructured quadrilateral elements on trimmed surfaces has been developed. Trimmed surfaces are often encountered in modeling of structures with complex shapes such as aircrafts, automobile structures, pressure vessels and etc. For unstructured mesh generation with quadrilateral elements, a domain decomposition algorithm employing loop operators has been used. Mesh generation on trimmed surface is performed in three steps. First, trimmed surfaces with holes or cuts are transformed to th largest projection planes in which the meshes are constructed. The constructed meshes are transformed to the u-v parametric plane and then finally to the original 3D surfaces. Th exact locations of holes or cuts in projection planes are determined by the Newton-Raphson method. Sample meshes are constructed to demonstrate the effectiveness of the proposed algorithm.

• International Journal of CAD/CAM
• /
• v.11 no.1
• /
• pp.11-17
• /
• 2011

A new method has been developed in this paper for automatic quadrilateral mesh generation for a two-dimensional domain. The method is named 'centering method' because it centers a point at the domain and then divides it into sub-domains using cutting lines from the center point. Each of the cutting lines is selected based on the criterion using the angles between the boundary of the domain and the cutting line. The decomposition of the domain into sub-domains is repeated until every subdomain has four or six nodes. Pre-defined splitters are used to divide six-node domains into quadrilateral elements depending on their configuration and presence on the boundary of the initial domain. Arbitrary domains are meshed as examples to verify the robustness of the new method.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 1997.10a
• /
• pp.17-23
• /
• 1997

In the two-dimensional Finite Element Method for forming simulation, mesh generation and remeshing process are very significant. In this paper, using the modified splitting mesh generation algorithm, we can overcome the limitation of existing techniques and acquire mesh, which has optimal mesh density. A modified splitting algorithm for automatically generating quadrilateral mesh within a complex domain is described. Unnecessary meshing process for density representation is removed. Especially, during the mesh generation with high gradient density like as shear band representation, the modified mesh density scheme, which will generate quadrilateral mesh with the minimized error, which takes effect on FEM solver, is introduced.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.17 no.12
• /
• pp.2995-3006
• /
• 1993

An automatic mesh generation scheme has been developed for finite element analysis with two-dimensional, quadrilateral elements. The basic strategies of the method are to transform the analysis domain into loops with key nodes and the loops are recursively subdivided into subloops with the use of best split lines. Finally by using the basic loop operators, the meshes are completed. In this algorithm an eight-node loop operator is proposed, which is useful in the area where the change of element size is large and the splitting criteria for subdividing the loops have also been modified to the existing algorithms. Lines, arcs, and cubic spline curves are used to define the boundaries of analysis domain. Sample meshes for several geometries are presented to demonstrate the robustness of the algorithm.

• Structural Engineering and Mechanics
• /
• v.11 no.4
• /
• pp.443-460
• /
• 2001

This paper presents an effective application of a variable-node axisymmetric solid element designated as AQV (Axisymmetric Quadrilateral Variable-node element). The variable-node element with physical midside nodes helps to overcome some problems in connecting the different layer patterns on a quadrilateral mesh in the adaptive h-refinement. This element alleviates the necessity of imposing displacement constraints on irregular (hanging) nodes in order to enforce the inter-element compatibility. Therefore, the elements with variable mid-side nodes can be used effectively in the local mesh refinement for the axisymmetric structures which have stress concentrations. A modified Gaussian quadrature should be adopted to evaluate the stiffness matrices of the variable-node elements mainly because of the slope discontinuity of assumed displacement within the elements. Some numerical examples show the usefulness of variable-node axisymmetric elements in the practical application.

• Structural Engineering and Mechanics
• /
• v.17 no.3_4
• /
• pp.379-391
• /
• 2004

This paper deals with the development of h-version adaptive mesh refinement and recovery strategy using variable-node elements and its application to various engineering field problems with 2D quadrilateral and 3D hexahedral models. The variable-node elements which have variable mid-side nodes on edges or faces are effectively used in overcoming some problems in connecting the different layer patterns of the transition zone between the refined and coarse mesh. A modified recovery technique of gradients adequate for variable-node elements and proper selection of error norms for each engineering field problems are proposed. In the region in which the error is greater than the permissible refinement error, the mesh is locally refined by subdivision. Reversely, in some parts of the domain having the error smaller than the permissible recovery error, the mesh is locally recovered (coarsened) by combination. Hierarchical structures (e.g. quadtrees and octrees) and element-based storage structures are composed to perform this adaptive process of refinement and recovery. Some numerical examples of a 3D heat conduction analysis of the concrete with hydration heat and a 2D flow analysis of vortex shedding show effectiveness and validity of the proposed scheme.

• Korean Journal of Computational Design and Engineering
• /
• v.10 no.1
• /
• pp.61-69
• /
• 2005

In the global ship structure and vibration analysis, the FE(finite element) analysis model is required in the early design stage before the 3D CAD model is defined. And the analysis model generation process is a time-consuming job and takes much more time than the engineering work itself. In particular, ship structure has too many associated structural members such as stringers, stiffness and girders etc. These structural members should be satisfied as the constraints in analysis modeling. Therefore it is necessary to support generation of analysis model with satisfying these constraints as an automatic manner. For the effective support of the global ship analysis modeling, a method to generate analysis model using initial design information within ship design process, that hull form offset data and compartment data, is developed. In order to easily handle initial design information and FE model information, flexible data structure is proposed. An automatic quadrilateral mesh generation algorithm using initial design information to satisfy the constraints imposed on the ship structure is also proposed. The proposed data structure and mesh generation algorithm are applied for the various type of vessels for the usability test. Through this test, we have verified the stability and usefulness of this system including mesh generation algorithm.