• The Journal of the Korea Contents Association
• /
• 제7권6호
• /
• pp.52-59
• /
• 2007

This paper presents a greedy method for user-steered mesh segmentation, which is based on the merging priority metric defined for representing the geometric properties of meaningful parts. The priority metric is a weighted function composed of five geometric parameters: distribution of Gaussian map, boundary path concavity, boundary path length, cardinality, and segmentation resolution. This scheme can be extended without any modification only by defining more geometric parameters and adding them. Our experimental results show that the shapes of segmented parts can be controlled by setting up the weight values of geometric parameters.

• Journal of Korea Multimedia Society
• /
• 제7권1호
• /
• pp.80-90
• /
• 2004

Watermarking algorithm for 3D mesh model using EGI distribution of each patch is proposed. The proposed algorithm divides a 3D mesh model into 6 patches to have the robustness against the partial geometric deformation. Plus, it uses EGI distributions as the consistent factor that has the robustness against the topological deformation. To satisfy both geometric and topological deformation, the same watermark bits for each subdivided patch are embedded by changing the mesh normal vectors. Moreover, the proposed algorithm does not need not only the original mesh model but also the resampling process to extract the watermark. Experimental results verify that the proposed algorithm is imperceptible and robust against geometrical and topological attacks.

• 한국전산유체공학회:학술대회논문집
• /
• 한국전산유체공학회 2009년 추계학술대회논문집
• /
• pp.34-37
• /
• 2009

Deforming mesh should be used when bodies are deforming or moving relative to each other due to the presence of aerodynamic forces and moments. Also, the flow solver for such a flow problem should satisfy the geometric conservation law to ensure the accuracy of the solutions. In this paper, a RANS(Reynolds Averaged Navier-Stokes) solver including automatic mesh capability using TFI(Transfinite Interpolation) method and GCL is developed and applied to flows induced by oscillating wings with given frequencies. The computations are performed both on deforming meshes and on rigid meshes. The computational results are compared with experimental data, which shows a good agreement.

• Journal of computational fluids engineering
• /
• 제15권1호
• /
• pp.37-45
• /
• 2010

Deforming mesh should be used when bodies are deforming or moving relative to each other due to the presence of aerodynamic forces and moments. Also, the flow solver for such a flow problem should satisfy the geometric conservation law to ensure the accuracy of the solutions. In this paper, a RANS(Reynolds Averaged Navier-Stokes) solver including automatic mesh capability using TFI(Transfinite Interpolation) method and GCL is developed and applied to flows induced by oscillating wings with given frequencies. The computations are performed both on deforming meshes and on rigid meshes. The computational results are compared with experimental data, which shows a good agreement.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• 제31권7호
• /
• 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.

• Transactions of Materials Processing
• /
• 제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.

• Journal of Mechanical Science and Technology
• /
• 제15권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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권11호
• /
• pp.4463-4482
• /
• 2020

Mesh model generated from 3D reconstruction usually comes with lots of noise, which challenges the performance and robustness of mesh simplification approaches. To overcome this problem, we present a novel method for mesh simplification which could preserve structure and improve the accuracy. Our algorithm considers both the planar structures and linear features. In the preprocessing step, it automatically detects a set of planar structures through an iterative diffusion approach based on Region Seed Growing algorithm; then robust linear features of the mesh model are extracted by exploiting image information and planar structures jointly; finally we simplify the mesh model with plane constraint QEM and linear feature preserving strategies. The proposed method can overcome the known problem that current simplification methods usually degrade the structural characteristics, especially when the decimation is extreme. Our experimental results demonstrate that the proposed method, compared to other simplification algorithms, can effectively improve the quality of mesh and yield an increased robustness on noisy input mesh.

• Korean Journal of Computational Design and Engineering
• /
• 제14권3호
• /
• pp.197-206
• /
• 2009

In a finite element analysis of the metal forming processes having large plastic deformation, largely distorted elements are unstable and hence they influence upon the result toward negative way so that adaptive remeshing is required to avoid a failure in the numerical computation. Therefore automatic mesh generation and regeneration is very important to avoid a numerical failure in a finite element analysis. In case of generating quadrilateral mesh, the automation is more difficult than that of triangular mesh because of its geometric complexity. However its demand is very high due to the precision of analysis. Thus, in this study, an automatic quadrilateral mesh generation and regeneration method using grid-based approach is developed. The developed method contains decision of grid size to generate initial mesh inside a two dimensional domain, classification of boundary angles and inner boundary nodes to improve element qualities in case of concave domains, and boundary projection to construct the final mesh.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• 제13권3호
• /
• pp.451-457
• /
• 2009

Most of objects in computer graphics may be represented by a form of mesh. The exact computation of vertex normal vectors is essential for user to apply a variety of geometric operations to the mesh and get more realistic rendering results. Most of the previous algorithms used a weight which resembles a local geometric property of a vertex of a mesh such as the interior angle, the area, and so on. In this paper, we propose an efficient algorithm for computing the normal vector of a vertex in meshes. Our method uses the conformal mapping which resembles synthetically the local geometric properties, and the mean value coordinates which may smoothly represent a relationship with the adjacent vertices. It may be confirmed by experiment that the normal vector of our algorithm is more exact than that of the previous methods.