• Korean Journal of Computational Design and Engineering
• /
• v.11 no.2
• /
• pp.138-147
• /
• 2006

A systematic approach to tetrahedral element or mesh generation, based on an advancing-front method and an optimal triangular mesh generation technique on the surface, is presented in this paper. The possible internal nodes are obtained by the octree-decomposition scheme. The initial tetrahedral mesh system is constructed by the advancing-front method and then it is improved by the quality improvement processes including mesh swapping and nodal smoothing. The approach is evaluated by investigating the normalized length, the normalized volume, the dihedral angle and the normalized quality

• Korean Journal of Computational Design and Engineering
• /
• v.10 no.3
• /
• pp.162-167
• /
• 2005

A 3D solid element mesh generation algorithm was newly developed. 3D surface points of global rectangular coordinates were supplied by a 3D laser scanner. The algorithm is strait forward and simple but it generates hexahedral solid elements. Then, the surface rectangular elements were generated from the solid elements. The key of the algorithm is elimination of unnecessary elements and 3D boundary surface fitting using given 3D surface point data.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.37 no.2
• /
• pp.21-30
• /
• 1995

In order to save time and efforts in generating finite element meshes in irregular houndaries of domains, it is needed to develop an automatic mesh-generator which can hoth promote the accuracy of solutions and reduce the run-time in operating finite ele- ment models. In this study, the advancing front technique of triangular mesh generation and the transforming technique from triangular meshes to quadrilateral meshes were used to de- velop a computer program for the automatic triangular and quadrilateral meshes in the mixed shape. Furthermore, to enhance the quadrilateral mesh quality, the techniques of Laplancian smoothing and interior mesh modification were employed. The mesh genera- tor was applied to evaluate its applicability to irregular and complex geometries such as Nakdong river bay. In has hoen shown that the automatic mesh generator developed is capable of automatically generating meshes for irreguiar and complex geometries with high qualities of meshes and with the simple input data of arbitrarily specified nodal spacing in bound- aries.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.2 no.4
• /
• pp.61-66
• /
• 2003

An excellent mesh construction is of Importance in yielding good results of finite element analysis. The new mesh generation algorithm, which offsets boundaries inward, was developed on the basis of a looping method. An user interface technique and automatic splitting lines which both divide a given domain into subdomains manually or automatically, were used. In addition, the separation method has advantages to prevent the large scale of element size and to control numbers of nodes and elements. This new mesh generation algorithm was proved in practice.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.07a
• /
• pp.220-220
• /
• 2004

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.697-698
• /
• 2006

In this paper, we propose a new scheme to generate multi-view images using a depth-image-based rendering (DIBR) technique. In order to improve the quality of multi-view images at newly exposed areas during mesh-based rendering, we preprocess the depth map using a Gaussian smoothing filter. Previous algorithms apply a smoothing filter to the whole depth map even if the depth map is collapsed. After extracting objects from the depth map, we apply the smoothing filter to their boundaries. Finally, we cannot only maintain the depth quality, but also generate high quality multi-view images. Experimental results show that our proposed algorithm outperforms previous works and supports an efficient depth keying technique.

• Korean Journal of Computational Design and Engineering
• /
• v.9 no.4
• /
• pp.294-305
• /
• 2004

Highly detailed geometric models are rapidly becoming commonplace in computer graphics and other applications. These complex models, which is often represented as complex1 triangle meshes, mainly suffer from the vast memory requirement for real-time manipulation of arbitrary geometric shapes without loss of data. Various techniques have been devised to challenge these problems in views of geometric processing, not a representation scheme. This paper proposes the new mesh structure for the compact representation and the efficient handling of the highly complex models. To verify the compactness and the efficiency, the memory requirement of our representation is first investigated and compared with other existing representations. And then we analyze the time complexity of our data structure by the most critical operation, that is, the enumeration of the so-called one-ring neighborhood of a vertex. Finally, we evaluate some elementary modeling functions such as mesh smoothing, simplification, and subdivision, which is to demonstrate the effectiveness and robustness of our mesh structure in the context of the geometric modeling and processing.

• Interaction and multiscale mechanics
• /
• v.2 no.3
• /
• pp.277-293
• /
• 2009

The Enriched Free Mesh Method (EFMM) is a patch-wise procedure in which both a displacement field on an element and a stress/strain field on a cluster of elements connected to a node can be defined. On the other hand, the Superconvergent Patch Recovery (SPR) is known to be an efficient post-processing procedure of the finite element method to estimate the error norm at a node. In this paper, we discuss the relationship between solutions of the EFMM and those of the SPR through several convergence studies. In addition, in order to solve the demerit of the smoothing effect on the fracture mechanics fields, we implement a singular stress field to a local patch in the EFMM, and its effectiveness is investigated.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2006.05a
• /
• 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.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2005.05a
• /
• pp.203-208
• /
• 2005

In this paper, an automated adaptive mesh generation scheme, based on an advancing-front-Delaunay method, is developed for finite element simulation of three dimensional bulk metal forming processes. During the simulation, the finite element mesh system is adaptively remeshed whenever the mesh is unacceptable. Several schemes are developed such as curvature compensation scheme to minimize volume loss, optimal smoothing scheme to improve element quality, etc. The presented approach is evaluated and applied to automatic forging simulation in order to demonstrate the effect of the developed schemes.