• Title/Summary/Keyword: 3 dimensional triangular mesh generation

Search Result 8, Processing Time 0.024 seconds

Automatic Generation of Triangular Ginite Element Meshes on Three-Dimensional Surfaces (3차원 곡면에서 삼각형 유한요소망의 자동생성)

  • 채수원;손창현
    • Korean Journal of Computational Design and Engineering
    • /
    • v.1 no.3
    • /
    • pp.224-233
    • /
    • 1996
  • An automatic mesh generation scheme with triangular finite elements on three-dimensional surfaces has been developed. The surface triangulation process is performed as follows. To begin, surfaces with key nodes are transformed to two-dimensional planes and the meshes with triangular elements are constructed in these planes. Finally, the constructed meshes are transformed back to the original 3D surfaces. For the mesh generation, an irregular mesh generation scheme is employed in which local mesh densities are assigned by the user along the boundaries of the analysis domain. For this purpose a looping algorithm combined with an advancing front technique using basic operators has been developed, in which the loops are recursively subdivided into subloops with the use of the best split lines and then the basic operators generate elements. Using the split lines, the original boundaries are split recursively until each loop contains a certain number of key nodes, and then using the basic operators such as type-1 and type-2, one or two triangular elements are generated at each operation. After the triangulation process has been completed for each meshing domain, the resulting meshes are finally improved by smoothing process. Sample meshes are presented to demonstrate the versatility of the algorithm.

  • PDF

Automatic Mesh Generation Method on The Offshore Wind Tower (해상 풍력 타워에 관한 자동요소 생성법)

  • Kim, Namhyeong;Kang, Hyunjin
    • Journal of the Korean Society for Marine Environment & Energy
    • /
    • v.16 no.2
    • /
    • pp.130-137
    • /
    • 2013
  • The more accurate numerical analysis is needed, The more important to arrange nodes and elements properly on the structures wanted to be analyzed. In this study, automatic mesh generation method is developed for triangular mesh modeling in wind tower and substructure formed in circular sections especially, which have structural and economical benefits in shallow water area. It can consider variety conditions by inputting the detail data such as height and types. Also, this study includes the comparison and verification with the mesh generation by Delaunay triangular technique on 3 dimensional space and the examples of mesh generation for proposed tower and substructure. The result of this study will be widely applied to analyze the existing and proposed models for wind turbines.

Two Dimensional Automatic Quadrilateral Mesh Generation for Metal Forming Analysis (소성 가공 공정 해석을 위한 2차원 사각 요소망 자동 생성)

  • Kim, Sang-Eun;Yang, Hyun-Ik
    • Korean Journal of Computational Design and Engineering
    • /
    • v.14 no.3
    • /
    • pp.197-206
    • /
    • 2009
  • In a finite element analysis of the metal forming processes having large plastic deformation, largely distorted elements are unstable and hence they influence upon the result toward negative way so that adaptive remeshing is required to avoid a failure in the numerical computation. Therefore automatic mesh generation and regeneration is very important to avoid a numerical failure in a finite element analysis. In case of generating quadrilateral mesh, the automation is more difficult than that of triangular mesh because of its geometric complexity. However its demand is very high due to the precision of analysis. Thus, in this study, an automatic quadrilateral mesh generation and regeneration method using grid-based approach is developed. The developed method contains decision of grid size to generate initial mesh inside a two dimensional domain, classification of boundary angles and inner boundary nodes to improve element qualities in case of concave domains, and boundary projection to construct the final mesh.

Triangular Mesh Generation Algorithm for Generating Nodes and Triangular Elements Concurrently (절점과 요소의 동시 생성을 위한 삼각 요소 알고리즘)

  • 천재홍;양현익
    • Korean Journal of Computational Design and Engineering
    • /
    • v.5 no.3
    • /
    • pp.207-214
    • /
    • 2000
  • For last 20 years, a number of researches and developments on finite element mesh generation has been carried out and most of them are comported of node generation part and node generation part. However these algorithms are inefficient in mesh veneration process and difficult to control the shape of elements when comparing with the generation of nodes and elements concurrently. In this study, therefore, an algorithm it proposed to generate nodes and elements concurrently for various two-dimensional objects having multiple holes. Inner node generation is performed by choosing three consecutive boundary nodes and comparing them with other close boundary nodes. As soon as inner nodes are determined, element generation is conducted based on the comparison of the distances among the generated inner nodes, three consecutive boundary nodes and other close boundary nodes. the generated element nodes become new boundary nodes for further repeated process. The processes are repeated through out each region until three consecutive boundary nodes finally form a tirangular element.

  • PDF

Generation of Triangular Mesh of Coronary Artery Using Mesh Merging (메쉬 병합을 통한 관상동맥의 삼각 표면 메쉬 모델 생성)

  • Jang, Yeonggul;Kim, Dong Hwan;Jeon, Byunghwan;Han, Dongjin;Shim, Hackjoon;Chang, Hyuk-jae
    • Journal of KIISE
    • /
    • v.43 no.4
    • /
    • pp.419-429
    • /
    • 2016
  • Generating a 3D surface model from coronary artery segmentation helps to not only improve the rendering efficiency but also the diagnostic accuracy by providing physiological informations such as fractional flow reserve using computational fluid dynamics (CFD). This paper proposes a method to generate a triangular surface mesh using vessel structure information acquired with coronary artery segmentation. The marching cube algorithm is a typical method for generating a triangular surface mesh from a segmentation result as bit mask. But it is difficult for methods based on marching cube algorithm to express the lumen of thin, small and winding vessels because the algorithm only works in a three-dimensional (3D) discrete space. The proposed method generates a more accurate triangular surface mesh for each singular vessel using vessel centerlines, normal vectors and lumen diameters estimated during the process of coronary artery segmentation as the input. Then, the meshes that are overlapped due to branching are processed by mesh merging and merged into a coronary mesh.

3D Automatic Mesh Generation Scheme for the Boundary Element Method (경계요소법을 위한 3차원 자동요소분할)

  • Lee, H.B.;Lee, S.H.;Kim, H.S.;Lee, K.S.;Hahn, S.Y.
    • Proceedings of the KIEE Conference
    • /
    • 1993.07b
    • /
    • pp.935-937
    • /
    • 1993
  • This paper presents a three dimensional automatic mesh generation scheme for the boundary element method, and this scheme can be applicable to practical problems of complex shape. The geometry of the problem is expressed as an assemblage of linear Coon's surfaces, and each surface is made up of four edge curves which are defined in the form of a parametric function. Curves are automatically segmented according to their characteristics. With these segments of curves, interior points and triangular mesh elements are generated in the parametric plane using Lindholm's method, and then their projection on the real surface forms the initial mesh. The refinement of initial mesh is performed so that the discrete triangular planes are close to the real continuous surfaces. The bisection method is used for the refinement. Finally, interior points in the refined mesh are rearranged so as to make each element be close with an equilateral triangle. An attempt has been made to apply the proposed method to a DY(Deflection Yoke) model.

  • PDF

Modeling and Analysis of Arbitrarily Shaped Three-Dimensional Cracks (임의 형태의 삼차원 균열 모델링 및 해석)

  • Park, Jai-Hak;Nikishkov, G.P.
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.35 no.9
    • /
    • pp.1091-1097
    • /
    • 2011
  • The SGBEM-FEM alternating method has been known to be a very effective method for analyzing threedimensional cracks in a finite body. The accurate values of the stress intensity factor can be obtained for a general planar or nonplanar three-dimensional crack. In the existing method, eight-noded quadrilateral boundary elements are used to model a crack. In some cases, three-node triangle boundary elements are more convenient for the modeling of a crack with a general shape. In this study, a crack is modeled with three-noded triangular and seven-noded quadrilateral elements by using the advancing-front mesh generation method. The stress intensity factors are obtained for cracks with several shapes and the accuracy of results is examined.

Octree Generation and Clipping Algorithm using Section Curves for Three Dimensional Cartesian Grid Generation (삼차원 직교 격자 생성을 위한 단면 커브를 이용한 옥트리 생성과 셀 절단 알고리듬)

  • Kim, Dong-Hun;Shin, Ha-Yong;Park, Se-Youn;Yi, Il-Lang;Kwon, Jang-Hyuk;Kwon, Oh-Joon
    • Korean Journal of Computational Design and Engineering
    • /
    • v.13 no.6
    • /
    • pp.450-458
    • /
    • 2008
  • Recently, Cartesian grid approach has been popular to generate grid meshes for complex geometries in CFD (Computational Fluid Dynamics) because it is based on the non-body-fitted technique. This paper presents a method of an octree generation and boundary cell clipping using section curves for fast octree generation and elimination of redundant intersections between boundary cells and triangles from 3D triangular mesh. The proposed octree generation method uses 2D Scan-Converting line algorithm, and the clipping is done by parameterization of vertices from section curves. Experimental results provide octree generation time as well as Cut-cell clipping time of several models. The result shows that the proposed octree generation is fast and has linear relationship between grid generation time and the number of cut-cells.