• 한국CDE학회논문집
• /
• 제6권2호
• /
• pp.125-132
• /
• 2001

An algorithm for generating all hexahedral meshes for three dimensional objects has been presented. This algorithm is based on the sweeping and the grafting method. In sweeping process internal nodes generating method has been modified by employing the distances between nodes on connecting surfaces and on source surfaces. In addition to the sweeping processes grafting algorithm is also modified to obtain more effective meshes by refining elements near grafting surfaces. With this method two and a half dimensional hexahedral meshes for three dimensional objects can be generated effectively. Sample meshes are constructed to demonstrate the mesh generating capability of the proposed algorithm.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제15권1호
• /
• pp.57-65
• /
• 2011

In this paper, a good quality mesh generation for the finite element method is investigated for artificial hip joint simulations. In general, bad meshes with a large aspect ratio or mixed elements can give rise to excessively long computational running times and extremely high errors. Typically, hexahedral elements outperform tetrahedral elements during three-dimensional contact analysis using the finite element method. Therefore, it is essential to mesh biologic structures with hexahedral elements. Four meshing schemes for the finite element analysis of an artificial hip joint are presented and compared: (1) tetrahedral elements, (2) wedge and hexahedral elements, (3) open cubic box hexahedral elements, and (4) proposed hexahedral elements. The proposed meshing scheme is to partition a part before seeding so that we have a high quality three-dimensional mesh which consists of only hexahedral elements. The von Mises stress distributions were obtained and analyzed. We also performed mesh refinement convergence tests for all four cases.

• 국제초고층학회논문집
• /
• 제8권4호
• /
• pp.255-264
• /
• 2019

This paper describes large eddy simulation of wind pressures on a square cylinder in a uniform flow and a high-rise building immersed in an atmospheric turbulent boundary layer. For the atmospheric boundary layer case, the inflow turbulence is generated by a numerical wind tunnel. In the numerical simulation, particular attention is devoted to the performance of an auto hexahedral non-structural mesh. Both simulations are performed for three grid systems: an auto hexahedral non-structured grid, a structured Cartesian grid and a non-structured triangular prism grid, and for three grid numbers. The present study shows that the auto hexahedral unstructured mesh achieves the best simulation results for wind pressures on the square cylinder and the high-rise building. When the grid number is sufficiently large, the differences among the results obtained from the three investigated grid systems are not significant. However, the advantage of the auto hexahedral unstructured mesh becomes clear when the grid number decreases, because it enables a balanced distribution of orthogonal grids. The results described in this paper demonstrate that the auto hexahedral non-structured mesh has good potential applicability to simulation of urban flows.

• Journal of Computational Design and Engineering
• /
• 제1권2호
• /
• pp.88-95
• /
• 2014

Because the cost of performance testing using actual products is expensive, manufacturers use lower-cost computer-aided design simulations for this function. In this paper, we propose using hexahedral meshes, which are more accurate than tetrahedral meshes, for finite element analysis. We propose automatic hexahedral mesh generation with sharp features to precisely represent the corresponding features of a target shape. Our hexahedral mesh is generated using a voxel-based algorithm. In our previous works, we fit the surface of the voxels to the target surface using Laplacian energy minimization. We used normal vectors in the fitting to preserve sharp features. However, this method could not represent concave sharp features precisely. In this proposal, we improve our previous Laplacian energy minimization by adding a term that depends on multi-normal vectors instead of using normal vectors. Furthermore, we accentuate a convex/concave surface subset to represent concave sharp features.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2006년도 춘계학술대회 논문집
• /
• pp.423-424
• /
• 2006

This paper proposes a hexahedral mesh generation scheme based on mapping approach and improves the drawback of sweeping algorithm. In order to improve the drawback, the algorithm in this paper generates hexahedral meshes by three dimensional element mapping first. Then hexahedral meshes are equivalent to geometry of the volume by mapping and smoothing. Sample meshes are constructed to demonstrate the mesh generating capability of the proposed algorithm.

• 한국소성가공학회:학술대회논문집
• /
• 한국소성가공학회 2004년도 추계학술대회논문집
• /
• pp.79-82
• /
• 2004

In this study, a new refinement technique for 3-dimensional hexahedral element mesh is proposed, which is aimed at the control of mesh density. With the proposed scheme the mesh is refined adaptively to the elemental error which is estimated by 'a posteriori' error estimator based on the energy norm. A desired accuracy of an analysis i.e. a limit of error defines the new desired mesh density map on the current mesh. To obtain the desired mesh density, the refinement procedure is repeated iteratively until no more elements to be refined exist. In the algorithm, at first the regions of mesh to be refined are defined and, then, the zero-thickness element layers are inserted into the interfaces between the regions. All the meshes in the regions, in which the zero-thickness layers are inserted, are to be regularized in order to improve the shape of the slender elements on the interfaces. This algorithm is tested on a simple shape of 2-d quadrilateral element mesh and 3-d hexahedral element mesh. A numerical example of elastic deformation of a plate with a hole shows the effectiveness of the proposed refinement scheme.

• 한국컴퓨터그래픽스학회논문지
• /
• 제22권2호
• /
• pp.20-26
• /
• 2016

본 논문에서는 Face-offsetting 기법을 적용하여 형상 내부의 중립면을 생성하고 영역을 분할한 후 육면체 요소망을 자동 생성하는 기법을 제안하였다. 제안된 기법이 육면체 요소망 생성을 위한 영역 분할에 사용될 수 있음을 검증하기 위하여 2종의 모델에 대한 요소망을 생성하고, 이의 형상비와 Jacobian 값을 기존의 방법들과 비교하여 품질을 평가하였다. 이를 통하여 Face-offsetting 기법을 이용한 중립면 생성과 영역 분할이 육면체 요소망 자동 생성에 효과적으로 사용될 수 있음을 확인하였다.

• 소성∙가공
• /
• 제12권4호
• /
• pp.340-347
• /
• 2003

In the rigid-plastic finite element simulation of hot forging processes using hexahedral mesh, remeshing of a flash is important for design and control of the process to obtain desirable defect-free products. The mesh compression method is a remeshing technique which enables the construction of an effective hexahedral mesh in the flash. However, because the mesh is distorted during the compression procedure of the mesh compression method, when it is used in resuming the analysis, it causes discretization error and decreases the conversance rate. Therefore, mesh smoothing is necessary to improve the mesh quality. In this study, several geometric mesh smoothing techniques and optimization techniques are introduced and modified to improve mesh quality. Then, the most adaptive technique is recommended for the mesh compression method.

• 한국소성가공학회:학술대회논문집
• /
• 한국소성가공학회 2003년도 춘계학술대회논문집
• /
• pp.323-326
• /
• 2003

This paper presents a new algorithm that can refine hexahedral elements while maintaining the appropriate connectivity. In the algorithm, at first the regions of mesh to be refined are defined and, then, the zero-thickness element layers inserted into the interfaces between the regions. All the meshes in the regions, in which the zero-thickness layers are inserted, are to be regularized in order to improve the shape of the slender elements on the interfaces. This algorithm is applied to the analysis of plastic deformation process. The results show that the refined mesh gives smaller relative errors than the original mesh.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2006년도 춘계학술대회 논문집
• /
• pp.419-420
• /
• 2006

This paper deals with a hex-dominant mesh generation using an advancing front method for three-dimensional geometries. Hexahedral and prismatic meshes are generated inwardly by offsetting from initial boundary mesh. When the meshes intersect with each other after offsetting, overlapped meshes are improved by node relocation method. In order to generate conforming mesh, pyramid elements are inserted between hexahedral and tetrahedral elements. Sample meshes fur several geometries are presented and analized to demonstrate the effectiveness of the proposed algorithm.