• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.29 no.5 s.236
• /
• pp.671-679
• /
• 2005

A method of generation boundary layer mesh has been presented. This paper describes the generation of semi-unstructured prismatic/tetrahedral meshes for three-dimensional geometries with thin thickness. By of fretting of surface triangle elements prismatic/tetrahedral meshes are generated and using the node relocation method of this research intersected meshes can be efficiently improved. Finally tetrahedral meshes are automatically generated at the rest of the domain. Sample meshes are constructed to demonstrate the mesh generating capability of the proposed algorithm.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.28 no.10
• /
• pp.1517-1525
• /
• 2004

Shell finite elements are widely used for the analysis of thin section objects such as sheet metal parts, automobile bodies and et al. due to their computational efficiency. Since many of input data for finite element analysis are given as solid models or triangulated surface models, one should extract midsurface information from these input data initially and then construct shell meshes on the extracted midsurfaces. In this paper, a method of generating shell elements on midsurfaces directly from input models has been proposed, in which midsurface generating process can be omitted. In order to construct shell meshes, the input models should be triangulated on surfaces first, and then tetrahedral elements are generated by using an advancing front method, and finally mid shell surfaces are obtained from tetrahedral meshes. Some examples are given to demonstrate the efficiency of the proposed method.

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

In this paper, a tetrahedral mesh generation algorithm which uses a grid based method for interior region and an advancing front method for outer surface region is proposed. In order to apply an advancing front method for outer region of an object, a new operator so called a hole operator has been developed to handle multiple shells. With this grid based approach in the interior region, more stable and uniform meshes can be constructed especially in the interior region.

• Proceedings of the KSME Conference
• /
• 2004.04a
• /
• pp.700-705
• /
• 2004

Shell finite elements are widely used for the analysis of thin section objects such as sheet metal parts, automobile bodies and et al. due to their computational efficiency. Since many of input data for finite element analysis are given as solid models or triangulated surface models, one should extract midsurface information from these input data initially and then construct shell meshes on the extracted midsurfaces. In this paper, a method of generating shell elements on midsurfaces directly from input models have been proposed. In order to construct shell meshes, the input models should be triangulated on surfaces first, and then tetrahedral elements are generated by using an advancing front method, and finally mid shell surfaces are obtained from tetrahedral meshes. Some examples are given to demonstrate the efficiency of the proposed method.

• Nuclear Engineering and Technology
• /
• v.52 no.3
• /
• pp.485-498
• /
• 2020

A diffusion synthetic acceleration (DSA) technique for the S_N transport equation discretized with the linear discontinuous expansion method with subcell balance (LDEM-SCB) on unstructured tetrahedral meshes is presented. The LDEM-SCB scheme solves the transport equation with the discrete ordinates method by using the subcell balances and linear discontinuous expansion of the flux. Discretized DSA equations are derived by consistently discretizing the continuous diffusion equation with the LDEM-SCB method, however, the discretized diffusion equations are not fully consistent with the discretized transport equations. In addition, a fine mesh rebalance (FMR) method is devised to accelerate the discretized diffusion equation coupled with the preconditioned conjugate gradient (CG) method. The DSA method is applied to various test problems to show its effectiveness in speeding up the iterative convergence of the transport equation. The results show that the DSA method gives small spectral radii for the tetrahedral meshes having various minimum aspect ratios even in highly scattering dominant mediums for the homogeneous test problems. The numerical tests for the homogeneous and heterogeneous problems show that DSA with FMR (with preconditioned CG) gives significantly higher speedups and robustness than the one with the Gauss-Seidel-like iteration.

• Journal of the Korean Society for Precision Engineering
• /
• v.21 no.3
• /
• pp.91-99
• /
• 2004

An unstructured tetrahedral mesh generation algorithm has been presented. In order to construct better meshes in interior region by using an advancing front technique, a connecting operator and a local finishing operator II have been developed in addition to the existing operators. Before applying digging operators that generate new nodes inside of a meshing region, a connecting operator is employed that uses existing nodes which satisfy certain conditions for producing well-conditioned elements. The local finishing operator II is introduced to terminate the meshing process more flexibly on remaining subregions. With these new operators, tetrahedral meshing process becomes more robust and good quality of meshes are constructed.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.39 no.9
• /
• pp.921-927
• /
• 1990

This paper presents a mesh refinement scheme for 3-D adaptive finite element method. Firstly, the refinement of triangular meshes based on the bisection of triangles is discussed. And a new method to refine tetrahedral meshes employing the bisection method is presented. In two dimensional cases, it has been noted that all angles in the triangular meshes refined by the bisection method are greater than or equal to half the smallest angle in the original meshes. Through the examples where the newly proposed method is applied to three dimensional cases, it is shown that regarding the solid angles, the method gives nearly the same result as that in the two dimensional case. Accordingly, it can be concluded that the proposed method will be useful in the mesh refinements for 3-D adaptive finite element method.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2003.06a
• /
• pp.1605-1608
• /
• 2003

A unstructured tetrahedral mesh generation algorithm has been presented. To make better meshes in interior region using an advancing front technique, a connecting operator has been developed in addition to the existing operators. Before applying digging operators that generate new nodes inside of a meshing region, a connecting operator is employed that uses existing nodes which satisfy certain conditions for producing well-conditioned elements if possible. By introducing this new operator, tetrahedral meshing process becomes more robust and produces better quality of meshes.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.18 no.12
• /
• pp.3159-3174
• /
• 1994

A simple octree encoding algorithm based on a tetrahedron root has been developed to be used for fully automatic generation of three dimensional finite element meshes. This algorithm starts octree decomposition from a tetrahedron root node instead of a hexahedron root node so that the terminal mode has the same topology as the final tetrahedral mesh. As a result, the terminal octant can be used as a tetrahedral finite element without transforming its topology. In this part(I) of the thesis, an efficient algorithm for the tetrahedron-based octree is proposed. For this development, the following problems have been solved, : (1) an efficient data structure for storing the octree and finite elements, (2) an encoding scheme of a tetrahedral octree, (3) a neighbor finding technique for the tetrahedron-based octree.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.19 no.3
• /
• pp.647-660
• /
• 1995

Given the tetrahedron-based octree approximation of a solid as described in part(I) of this thesis, in this part(II) a systematic procedure of 'boundary moving' is developed for the fully automatic generation of 3D finite element meshes. The algorithm moves some vertices of the octants near the boundary onto the exact surface of a solid without transforming the topology of octree leaf elements. As a result, the inner octree leaf elements can be used as exact tetrahedral finite element meshes. In addition, as a quality measure of a tetrahedral element, 'shape value' is propopsed and used for the generation of better finite elements during the boundary moving process.