• 제목/요약/키워드: Tetrahedral Meshes

검색결과 26건 처리시간 0.027초

얇은 두께의 3차원 형상에 경계층 요소 생성 (Boundary Layer Mesh Generation for Three-Dimensional Geometries with Thin Thickness)

  • 권기연;채수원;이병채
    • 대한기계학회논문집A
    • /
    • 제29권5호
    • /
    • 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.

셀 구조물에서 중립면에 대한 유한요소망의 자동생성 (Automatic Generation of Finite Element Meshes on Midsurfaces in Shell Structures)

  • 손준희;채수원
    • 대한기계학회논문집A
    • /
    • 제28권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.

격자법과 전진경계법을 흔합한 사면체 요소망의 자동생성 (Tetrahedral Mesh Generation Using a Mixed Method of a Grid and an Advancing Front Approach)

  • 김영웅;전성재;채수원
    • 한국CDE학회논문집
    • /
    • 제8권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.

3 차원 구조물에서 Chordal Axis Transform 을 이용한 쉘 요소망의 자동생성 (Automatic Generation of Shell Elements by Using Chordal Axis Transform in 3D Structures)

  • 손준희;채수원
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2004년도 춘계학술대회
    • /
    • 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.

  • PDF

Diffusion synthetic acceleration with the fine mesh rebalance of the subcell balance method with tetrahedral meshes for SN transport calculations

  • Muhammad, Habib;Hong, Ser Gi
    • Nuclear Engineering and Technology
    • /
    • 제52권3호
    • /
    • pp.485-498
    • /
    • 2020
  • A diffusion synthetic acceleration (DSA) technique for the SN 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.

절점 탐색이 적용된 전진경계법에 의한 사면체 요소망의 자동생성 (Automatic Tetrahedral Mesh Generation Using Advancing Front Technique with Node Searching)

  • 전성재;채수원
    • 한국정밀공학회지
    • /
    • 제21권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.

3차원 적응 유한요소법을 위한 사면체 요소세분에 관한 연구 (A Study on Mesh Refinement for 3-D Adaptive Finite Element Method Using Tetrahedral Element)

  • 김형석;정현교;한송엽
    • 대한전기학회논문지
    • /
    • 제39권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.

  • PDF

전진경계법에서 Delaunay 탐색조건을 이용한 사면체 요소망의 자동 생성 (Automatic Tetrahedral Mesh Generation using Advancing Front Technique with Delaunay Node Searching)

  • 전성재;채수원
    • 한국정밀공학회:학술대회논문집
    • /
    • 한국정밀공학회 2003년도 춘계학술대회 논문집
    • /
    • 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.

  • PDF

삼차원 유한요소의 자동생성 (1) - 사면체 옥트리의 구성 - (Automatic Generation of 3-D Finite Element Meshes : Part(I) - Tetrahedron-Based Octree Encoding -)

  • 정융호;이건우
    • 대한기계학회논문집
    • /
    • 제18권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.

삼차원 유한요소의 자동생성 (2) -사면체 옥트리로부터의 유한요소 생성- (Automatic Generation of 3-D Finite Element Meshes: Part(II) -Mesh Generation from Tetrahedron-based Octree-)

  • 정융호;이건우
    • 대한기계학회논문집
    • /
    • 제19권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.