• Title/Summary/Keyword: 사면체 요소망

Search Result 17, Processing Time 0.03 seconds

Tetrahedral Meshing with an Octree-based Adaptive Signed Distance Field (옥트리 기반의 적응적 부호거리장을 이용한 사면체 요소망 생성)

  • Park, Seok-Hun;Choi, Min-Gyu
    • Journal of the Korea Computer Graphics Society
    • /
    • v.18 no.1
    • /
    • pp.29-34
    • /
    • 2012
  • High-quality tetrahedral meshes are crucial for FEM-based simulation of large elasto-plastic deformation and tetrahedral-mesh-based simulation of fluid flow. This paper proposes a volume meshing method that exploits an octree-based adaptive signed distance field to fill the inside of a polygonal object with tetrahedra, of which dihedral angles are good. The suggested method utilizes an octree structure to reduce the total number of tetrahedra by space-efficiently filling an object with graded tetrahedra. To obtain a high-quality mesh with good dihedral angles, we restrict the octree in such a way that any pair of neighboring cells only differs by one level. In octree-based tetrahedral meshing, the signed distance computation of a point to the surface of a given object is a very important and frequently-called operation. To accelerate this operation, we develop a method that computes a signed distance field directly on the vertices of the octree cells while constructing the octree using a top-down approach. This is the main focus of the paper. The suggested tetrahedral meshing method is fast, stable and easy to implement.

Octree-Based Adaptive Tetrahedral Meshing (옥트리 기반의 적응적 사면체 요소망구성)

  • Kim, Chul-Won;Park, Suk-Hoon;Choi, Min-Gyu
    • Journal of the Korea Computer Graphics Society
    • /
    • v.17 no.2
    • /
    • pp.45-53
    • /
    • 2011
  • This paper proposes a volume meshing method that fills the inside of an object with tetrahedra, of which dihedral angles are good. The suggested method is fast, stable and easy to implement It can also utilize an octree structure to space-efficiently fill an object with graded tetrahedra by reducing the total number of tetrahedra. To obtain a high-quality mesh with good dihedral angles, we restrict the octree such that any pair of neighboring cells only differs by one level. To efficiently construct a restricted-octree and generate a volume mesh from the octree, we utilize a signed distance field of an object on its bounded workspace. The suggested method can be employed in FEM-based simulation of large elasto-plastic deformation and tetrahedral-mesh-based simulation of fluid flow.

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

  • 전성재;채수원
    • 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.

Automatic Generation of Tetrahedral Meshes from General Sections (일반 단면으로부터 사면체 요소망의 자동생성)

  • Chae, Su-Won;Lee, Gyu-Min;Sin, Sang-Yeop
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.24 no.1 s.173
    • /
    • pp.196-205
    • /
    • 2000
  • Computed Tomography (CT), Nuclear Magnetic Resonance Imaging (MR1) and some ultrasound techniques make it possible to obtain cross sections of human body or mechanical parts. In CAD system, a series of sectional surfaces can also be obtained from solid models of 3D objects. In this paper we introduce a tetrahedral meshing algorithm from these series of general sections using basic operators. In this scheme. general sections of three-dimensional object are triangulated first and side surfaces between two sections are triangulated by the use of tiling process. Finally tetrahedral meshing process is performed on each layer of 3D objects, which is composed of two general sections and one side surface.

대변형 해석에서 평활화를 이용한 사면체 요소망의 재조성

  • Gwon, Gi-Hwan;Chae, Su-Won;Sin, Sang-Yeop
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.24 no.9 s.180
    • /
    • pp.2397-2405
    • /
    • 2000
  • The remeshing is a method to replace a distorted mesh by a new mesh without interrupting the finite element calculation. The remeshing procedure in this paper refers to the rezoning, for which a sm oothing process is developed to alleviate the distortions of mesh. In the paper, an automatic finite element rezoning system with tetrahedral elements for large deformation analysis has been developed. Our smoothing process is composed of two steps, a surface smoothing and a volume smoothing. In the surface smoothing, checking the dihedral angle and projection on surface patch reduced the change of shape and nodes penetrating die. The constrained Laplacian smoothing has been employed for the volume smoothing process. The state variables are mapped from old mesh to new mesh by using volume coordinates within a tetrahedral element. All these procedures have been linked to the NIKE3D program As illustrated in the examples the overall strategy ensures a robust and efficient rezoning scheme for finite element simulation of metal-forming processes.

Tetrahedral Mesh Generation from CT Images of Thoracic Vertebra (흉추 CT 영상으로부터 사면체 요소망의 자동생성)

  • 박정민;권기환;전성재;채수원;이관행;이태수;서중근;박정율
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2002.05a
    • /
    • pp.150-153
    • /
    • 2002
  • The use of the finite element method for biomechanical analysis is increasing rapidly in recent years. Since biomechanical models are usually in very complex shapes, it takes a lot of time and efforts to build reasonable finite element models. In this paper, a new tetrahedral meshing algorithm from the series of 2-D computed tomography(CT) images has been proposed. In this scheme, the planar sections of three-dimensional objects and the side surfaces between two planar sections are triangulated first, and then an advancing front algorithm is employed to construct tetrahedral elements by using basic operators. A sample finite element model for thoracic vertebra is presented.

  • PDF

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

  • Son Jun-Hee;Chae Soo-Won
    • 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.

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

  • Son, Jun-Hee;Chae, Soo-Won
    • 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.

  • PDF

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

  • 전성재;채수원
    • 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.

  • PDF

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

  • 김영웅;전성재;채수원
    • 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.