• Transactions of the Korean Society of Mechanical Engineers
• /
• v.17 no.9
• /
• pp.2242-2251
• /
• 1993

The mesh-based frictional contact model has been developed which does not rely on the spatial derivatives of the tool surface. Only points on the surface are evaluated from the description. which can then be simplified because of the relaxed demands placed on it. The surface tangents, normals, and corresponding derivatives at each finite-element node are evaluated directly from the finite-element mesh, in terms of the connecting nodal positions. The advantages accrue because there is no longer a need for a smooth tool surface to assure reasonable normals and derivatives. Furthermore, it can be shown that the equilibrium equations can only be properly written with a special normal derived from the mesh itself. The validity, accuracy, computation time, and stability of mesh-based contact model were discussed with the numerical examples of rounded flat-top and rough, flat-top rounded punch forming operations. Also, the forming process of a automobile inner panel section was simulated for testing the robustness of new contact model. In the discussion, the superiority of new model was examined, comparing with tool-based contact one.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.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.

• Korean Journal of Computational Design and Engineering
• /
• v.13 no.1
• /
• pp.1-7
• /
• 2008

Data compression becomes increasingly an important issue for reducing data storage spaces as well as transmis-sion time in network environments. In 3D geometric models, the normal vectors of faces or meshes take a major portion of the data so that the compression of the vectors, which involves the trade off between the distortion of the images and compression ratios, plays a key role in reducing the size of the models. So, raising the compression ratio when the normal vector is compressed and minimizing the visual distortion of shape model's shading after compression are important. According to the recent papers, normal vector compression is useful to heighten com-pression ratio and to improve memory efficiency. But, the study about distortion of shading when the normal vector is compressed is rare relatively. In this paper, new normal vector compression method which is clustering normal vectors and assigning Representative Normal Vector (RNV) to each cluster and using the angular deviation from actual normal vector is proposed. And, using this new method, Visually Undistinguishable Lossy Compression (VULC) algorithm which distortion of shape model's shading by angular deviation of normal vector cannot be identified visually has been developed. And, being applied to the complicated shape models, this algorithm gave a good effectiveness.

• Korean Journal of Computational Design and Engineering
• /
• v.6 no.3
• /
• pp.184-192
• /
• 2001

In this paper we present a remeshing algorithm for irregular meshes with boundaries. The irregular meshes are approximated by regular meshes where the topological regularity is essential for the multiresolutional analysis of the given meshes. Normal meshes are utilized to reduce the necessary data size at each resolution level of the regularized meshes. The normal mesh uses one scalar value, i.e., normal offset value which is based on the regular rule of a uniform subdivision, while other remeshing schemes use one 3D vector at each vertex. Since the normal offset cannot be properly used for the boundaries of meshes, we use a combined subdivision scheme which resolves a problem of the proposed normal offset method at the boundaries. Finally, we show an example to see the effectiveness of the proposed scheme to reduce the data size of a mesh model.

• Korean Journal of Computational Design and Engineering
• /
• v.12 no.2
• /
• pp.109-117
• /
• 2007

Three-dimensional mesh models have been widely used in various applications such as simulations, animations, and e-catalogs. In such applications the normal vectors of mesh models are used mainly for shading and take up the major portion of data size and transmission time paper over networks. Therefore a variety of techniques have been developed to compress them efficiently. In this paper, we propose the MOEC (Modified Octree Encoding Compression) algorithm, which allow multi lever compression ratios for 3D mesh models. In the algorithm, a modified octree has nodes representing their own positions and supporting a depth of the tree so that the normal vectors are compressed up to levels where the shading is visually indistinguishable. This approach provides efficient in compressing normals with multi-level ratios, without additional encoding when changing in compression ratio is required.

• Journal of Korea Game Society
• /
• v.9 no.2
• /
• pp.135-142
• /
• 2009

Mesh denoising is a method to remove noise applying various filters. However, those methods usually spend much time since filtering is performed on CPU. Because GPU is specialized for floating point operations and faster than CPU, real-time processing for complex operations is possible. Especially mesh denoising is adequate for GPU parallel processing since it repeats the same operations for vertices or triangles. In this paper, we propose mesh denoising algorithm based on bilateral filtering using GPU parallel processing to reduce processing time. It finds neighbor triangles of each vertex for applying bilateral filter, and computes its normal vector. Then it performs bilateral filtering to estimate new vertex position and to update its normal vector.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.2
• /
• pp.22-29
• /
• 2002

This paper presents an algorithm for segmentation of 3D triangular mesh data. The proposed algorithm uses iterative merging of adjacent triangle pairs based on the orientation of triangles. The surface is segmented into patches, where each patch has a similar normal property Thus, each region can be approximated to planar patch and its boundaries have perceptually important geometric information of the entire mesh model. The experimental results show that the Proposed algorithm is peformed efficiently.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.3
• /
• pp.160-174
• /
• 2008

In this paper, we propose new coding techniques for photometry data of three-dimensional(3-D) mesh models. We make a good use of geometry and connectivity information to improve coding efficiency of color, normal vector, and texture data. First of all, we determine the coding order of photometry data exploiting connectivity information. Then, we exploit the obtained geometry information of neighboring vortices through the previous process to predict the photometry data. For color coding, the predicted color of the current vertex is computed by a weighted sum of colors for adjacent vortices considering geometrical characteristics between the current vortex and the adjacent vortices at the geometry predictor. For normal vector coding, the normal vector of the current vertex is equal to one of the optimal plane produced by the optimal plane generator with distance equalizer owing to the property of an isosceles triangle. For texture coding, our proposed method removes discontinuity in the texture coordinates and reallocates texture image segments according to the coding order. Simulation results show that the proposed compression schemes provide improved performance over previous works for various 3-D mesh models.

• Journal of the Korean Society for Precision Engineering
• /
• v.13 no.10
• /
• pp.46-55
• /
• 1996

As industrial standard data, the STL format which approximates three dimensional CAD model to triangular facets, is used for RP(Rapid Prototyping) system in recent days. Because most RP system take the only form of two dimensional line segments as an input stream inspite of its imperfectness while converting into STL format, a CAD model is converted into a standard industrial format which is composed of many triangular facets. The error verifying process is composed of four main steps, and these are 1) Remove facets with two or more vertices equal to each other. 2) Fix overlapping error such as more than three facets adjacent to anedge. 3) Fill holes in the mesh by using Delaunay triangulation method. 4) Correct the wrong direction and normal vectors. This paper is concerned with serching the mentioned errors in advance and modifying them.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2001.10a
• /
• pp.58-61
• /
• 2001

An implicit finite element formulation for axisymmetric tube hydroforming is investigated. In order to describe normal anisotropy of the tube, Hill's non-quadratic yield function is employed. The frictional contact between die and tube and frictionless contact between tube and fluid are considered using the mesh-normal vector computed from finite element mesh of the tube. In order to verify the validity of the developed finite element formulation, the axisymmetric tube bulge test is simulated and simulation results are compared with experimental measurements. In the axisymmetric tube hydroforming process, an optimal hydraulic curve is pursued by performing the simulation with various internal pressures and axial forces.