• 제목/요약/키워드: Mesh Generation

검색결과 524건 처리시간 0.024초

BEM에서의 자동요소분할 알고리즘의 구현 (An Implementation of Automesh Generation Algorithm in Boundary Element Method)

  • 오환섭
    • 한국공작기계학회:학술대회논문집
    • /
    • 한국공작기계학회 1996년도 추계학술대회 논문
    • /
    • pp.144-149
    • /
    • 1996
  • The automation of mesh generation in BEM is bery important in numerical analysys field for the time and efficiency. To be solve this problem Probram and Algorithm, to achive purpose of making input data and automation of mesh generation based on Expert system is developed in this study. And function of this program can be rotating and zooming, To prove efficiency and availability of program in result the stress intensity factor which is criteria of fracture mechanics is caculated and compared with other results.

  • PDF

풀밴드 GaAs monte carlo 시뮬레이션을 위한 최적사면체격자의 발생 (Generation of a adaptive tetrahedral refinement mesh for GaAs full band monte carlo simulation)

  • 정학기
    • 전자공학회논문지D
    • /
    • 제34D권7호
    • /
    • pp.37-44
    • /
    • 1997
  • A dadaptive refinement tetrahedron mesh has been presented for using in full band GaAs monte carlo simulation. A uniform tetrahedron mesh is used without regard to energy values and energy variety in case of the past full band simulation. For the uniform tetrahedron mesh, a fine tetrahedron is demanded for keeping up accuracy of calculation in the low energy region such as .GAMMA.-valley, but calculation time is vast due to usin gthe same tetrahedron in the high energy region. The mesh of this study, thererfore, is consisted of the fine mesh in the low energy and large variable energy region and rough mesh n the high energy. The density of states (DOS) calculated with this mesh is compared with the one of the uniform mesh. The DOS of this mesh is improved th efive times or so in root mean square error and the ten times in the correlation coefficient than the one of a uniform mesh. This refinement mesh, therefore, can be used a sthe basic mesh for the full band GaAs monte carlo simulation.

  • PDF

CAGD를 이용한 프리폼 이산화 공간구조물의 유한요소망 자동생성기법 (Automatic FE Mesh Generation Technique using Computer Aided Geometric Design for Free-form Discrete Spatial Structure)

  • 이상진
    • 한국공간구조학회논문집
    • /
    • 제10권2호
    • /
    • pp.77-86
    • /
    • 2010
  • 본 연구에서는 프리폼(free form)을 가지는 공간구조물의 유한요소망을 자동으로 생성하는 기법을 개발하고 그 배경이론과 수치실험 결과 그리고 이용방안에 대하여 기술하였다. 본 연구를 통하여 제시한 유한요소망 생성기법은 공간구조물의 해석을 위해 전통적으로 이용하던 형태별 자동생성기법의 한계를 극복하기 위하여 개발 되었다. 개발된 자동 생성기법은 최근 연속체 쉘 구조물의 형태를 정확히 구현하기 위해 활발히 이용되고 있는 CAGD기법을 도입하였다. 본 연구에서 제시된 자동생성기법은 두 단계의 생성과정을 거치는데 첫 번째가 구조물의 형태를 기하학적인 모델로 표현하는 단계이며 두 번째가 표현된 기하학적인 모델에 이산화된 공간구조물을 생성하는 단계이다. 수치실험을 통하여 본 연구에서 개발된 자동생성기법이 임의의 형상을 가지는 이산화된 공간구조물을 표현하기 용이할 뿐만이 아니라 기존의 자동생성기법을 수정 이용할 수 있는 장점이 있으며 특히 이산화된 공간구조물의 형상최적화에도 효과적으로 이용될 수 있을 것으로 나타났다.

  • PDF

격자밀도에 적응하는 드로우니 격자 생성방법 (Modified Delaunay Mesh generation adapted to the mesh density map)

  • 홍진태;이석렬;양동열
    • 한국소성가공학회:학술대회논문집
    • /
    • 한국소성가공학회 2003년도 추계학술대회논문집
    • /
    • pp.159-162
    • /
    • 2003
  • The remeshing algorithm using the constrained Delaunay method adapted to the mesh density map is developed. In the finite element simulation of forging process, the numerical error increases as the process goes on. However, it is not desirable to use a uniformly fine mesh in the whole domain. Therefore, it is necessary to reduce the analysis error by constructing locally fine mesh at the region where the error is concentrated such as die corner. In this paper, the point insertion algorithm is used and mesh size is controlled by using a mesh density map constructed with a posteriori error estimation. And an optimized smoothing technique is adapted to have smooth distribution and improve the quality of the mesh.

  • PDF

Development of Advanced Numerical techniques to Reduce Grid Dependency in Industrial CFD Applications

  • Blahowsky Hans Peter
    • 한국전산유체공학회:학술대회논문집
    • /
    • 한국전산유체공학회 1998년도 추계 학술대회논문집
    • /
    • pp.19-22
    • /
    • 1998
  • Automatic mesh generation procedures applied to industrial now problems lead to complex mesh topologies where usually no special considerations to mesh resolution are taken. In the present study a fast and flexible solution algorithm in combination with generalized higher order discretization schemes is presented and its application to intake port calculation is demonstrated.

  • PDF

2차원 자동요소분할 프로그램 개발에 관한 연구 (A Study on the Two-Dimensional Automatic Mesh Generation Programming)

  • 조명철;유형선
    • 한국정밀공학회지
    • /
    • 제9권2호
    • /
    • pp.44-51
    • /
    • 1992
  • This paper is concerned with the propram of the automatic mesh generation for 2-dimensional domain which contains the curved boundaries and holes. This program treats a new vertical-line drawing method. This method starts with 4-subdivisions of problem domain and the classification of the cross points of grid lines and boundaries. The new node is generated by the vertical line to the line connecting the two intersections of a boundary and two grid lines in gereral. And the node very close to the boundary is moved to the boundary. The automatic mesh generation composed of only rectangular elements is achieved by this procedure. The boundaries are piecewise-curves composed of lines, circles, arcs, and free curves. The free curves are generated by B-Spline form. Although there were some bad elements for the complex boundary, it was possible to obtain the acceptible rectangular elements for the given boundaries.

  • PDF

선체 곡면의 자동 요소화 (Automatic mesh generation on ship hull surface)

  • 윤태경;김동준
    • 한국해양공학회지
    • /
    • 제11권2호
    • /
    • pp.138-144
    • /
    • 1997
  • This is describes the automatic mesh generation on the ship hull surface. At first ship hull is defined as a cillocation of composite surface patches which satisfy the geometic continuity between adjoining patches by using Gregory surface method. Node points that would be mesh points are ganerated by considering the surface curvature. The triangulation of the node points is by the combination of Ohtsubo's method and Choi's one. After triangulation, shape improvement and quadrilateralization is done with specific criterin. An application to the actual ship and the results are shown.

  • PDF

얇은 두께의 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.

드로네이기법에 의한 고차 유한요소 생성 (Higher Order Elements by Delaunay Triangulation)

  • 송영준
    • 전산구조공학
    • /
    • 제9권4호
    • /
    • pp.141-154
    • /
    • 1996
  • 드로네이 요소생성기법은 모델링 영역의 모양에 구애받지 않으면서 요소의 크기제어, 재편성, 국지요소생성 등에 있어서 탁월한 기능을 보여주고 있다. 그러나 생성되는 요소가 선형삼각형요소임으로해서 비압축성 또는 대변위거동의 근사나 복잡한 형상의 영역의 기하학적 근사에 한계를 갖고 있다. 이를 보완하기 위해 기제시된 드로네이 요소생성 알고리즘을 바탕으로한 6절점 삼각요소 생성알고리즘을 제시하여 본 기법의 완성도를 높이고 이를 성형문제에 적용해 보였다.

  • PDF

사각형 유한요소망의 자동생성 (Automatic Mesh Generation with Quadrilateral Finite Elements)

  • 채수원;신보성;민중기
    • 대한기계학회논문집
    • /
    • 제17권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.