• Journal of Mechanical Science and Technology
• /
• v.16 no.2
• /
• pp.211-218
• /
• 2002

This paper proposes an unstructured tetrahedral meshing algorithm for CAD models in the IGES format. The work presented is based on the advancing front method, which was proposed by the third author. Originally, the advancing front method uses three basic operators, namely, trimming, wedging, and digging. In this research, in addition to the basic operators, three new operators splitting, local finishing, and octahedral-are added to stabilize the meshing process. In addition, improved check processes are applied to obtain better-shaped elements. The algorithm is demonstrated and evaluated by four examples.

• Tribology and Lubricants
• /
• v.36 no.5
• /
• pp.262-266
• /
• 2020

Herein, we present a numerical investigation of wear analysis of sliding systems with a constant speed subjected to Archard's wear law. For this investigation, we compared two methods: eigen-wear analysis and adaptive meshing technique. The eigen-wear analysis is advantageous to predict the evolution of contact pressure due to wear using the initial contact pressure and contact stiffness. The adaptive meshing technique in finite element analysis is employed to obtain transient wear behavior, which needs significant computational resources. From the eigen-wear analysis, we can determine the appropriate element size required for finite element analysis and the time increment required for wear evolution by a dimensionless variable above a certain value. Since the prediction of wear depends on the maximum contact pressure, the finite element model should have a reasonable representation of the maximum contact pressure. The maximum contact pressure and wear amount according to this dimensionless variable shows that the number of fine meshes in the contact area contributes more to the accuracy of the wear analysis, and the time increment is less sensitive when the number of contact nodes is significantly larger. The results derived from a two-dimensional wear model can be applied to a three-dimensional wear model.

• Korean Journal of Computational Design and Engineering
• /
• v.5 no.1
• /
• pp.95-101
• /
• 2000

For last two decades numerous automatic mesh generation algorithms for various two dimensional objects have been introduced continuously and among them triangular mesh generation schemes have been majority because of efficiency and controllability. In our study, an existing triangular mesh generation algorithm developed by Lo is totally modified to more improve node distribution, element shape, and objects shape independency. ft is composed of node generation part and element generation part. In order to find a suitable node position within geometry, the suggested algorithm searches desirable positions of points within boundary and optimizes node position to generate comparatively well-shaped elements. More over, the suggested algorithm handles various complex two dimensional objects and its meshing speed shows superiority to those of the existing triangulation mesh generation algorithms. It is fully automated in a sense of constructing object boundary and hence can be directly used as an independent meshing software.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.31 no.7 s.262
• /
• pp.739-746
• /
• 2007

Recently, models in STL files are widely used in reverse engineering processes, CAD systems and analysis systems. However the models have poor geometric quality and include only triangles, so the models are not suitable for the finite element analysis. This paper presents a general method that generates finite element mesh from STL file models. Given triangular meshes, the method estimates triangles and makes clusters which consist of triangles. The clusters are merged by some geometric indices. After merging clusters, the method applies plane meshing algorithm, based on domain decomposition method, to each cluster and then the result plane mesh is projected into the original triangular set. Because the algorithm uses general methods to generate plane mesh, we can obtain both tri and quad meshes unlike previous researches. Some mechanical part models are used to show the validity of the proposed method.

• Korean Journal of Computational Design and Engineering
• /
• v.20 no.2
• /
• pp.104-113
• /
• 2015

In developing a tire, many CAE analyses are performed to make a better tire. But its meshing work is not easy, and it takes much time. One of the reasons of taking much time is that there are many overlapped geometric entities in CAD data that are modeled in CAD system by CAD engineers. In this study, we studied about the features of the overlapped geometric entities, and the method to find out and delete them. I developed a program using the proposed algorithm, and applied it in meshing tire pattern and tire case. I proved that the time in meshing a tire reduced dramatically by removing overlapped geometric entities by using the developed program.

• 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.

• 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.

• Journal of the Korea Society of Computer and Information
• /
• v.28 no.12
• /
• pp.89-96
• /
• 2023

In this paper, we propose a GPU-based method for real-time processing of dynamic re-meshing required for tearing cloth. Thin shell materials are used in various fields such as physics-based simulation/animation, games, and virtual reality. Tearing the fabric requires dynamically updating the geometry and connectivity, making the process complex and computationally intensive. This process needs to be fast, especially when dealing with interactive content. Most methods perform re-meshing through low-resolution simulations to maintain real-time, or rely on an already segmented pattern, which is not considered dynamic re-meshing, and the quality of the torn pattern is low. In this paper, we propose a new GPU-optimized dynamic re-meshing algorithm that enables real-time processing of high-resolution fabric tears. The method proposed in this paper can be used for virtual surgical simulation and physics-based modeling in games and virtual environments that require real-time, as it allows dynamic re-meshing rather than pre-split meshes.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2007.11a
• /
• pp.427-428
• /
• 2007

• Journal of Mechanical Science and Technology
• /
• v.15 no.5
• /
• pp.592-601
• /
• 2001

An automatic mesh generation scheme with unstructured quadrilateral elements on trimmed NURBS surfaces has been developed. In this paper NURBS surface geometries in the IGES format have been employed to represent geometric models. For unstructured mesh generation with quadrilateral elements, a domain decomposition algorithm employing loop operators has been modified. As for the surface meshing, an indirect 2D approach is proposed in which both quasi-expanded planes and projection planes are employed. Sampled meshes for complex models are presented to demonstrate the robustness of the algorithm.