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

• 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 Mechanical Science and Technology
• /
• v.17 no.7
• /
• pp.986-998
• /
• 2003

In this paper, an adaptive numerical integration scheme, which does not need non-overlapping and contiguous integration meshes, is proposed for the MLPG (Meshless Local Petrov-Galerkin) method. In the proposed algorithm, the integration points are located between the neighboring nodes to properly consider the irregular nodal distribution, and the nodal points are also included as integration points. For numerical integration without well-defined meshes, the Shepard shape function is adopted to approximate the integrand in the local symmetric weak form, by the values of the integrand at the integration points. This procedure makes it possible to integrate the local symmetric weak form without any integration meshes (non-overlapping and contiguous integration domains). The convergence tests are performed, to investigate the present scheme and several numerical examples are analyzed by using the proposed scheme.

• Korean Journal of Computational Design and Engineering
• /
• v.1 no.3
• /
• pp.224-233
• /
• 1996

An automatic mesh generation scheme with triangular finite elements on three-dimensional surfaces has been developed. The surface triangulation process is performed as follows. To begin, surfaces with key nodes are transformed to two-dimensional planes and the meshes with triangular elements are constructed in these planes. Finally, the constructed meshes are transformed back to the original 3D surfaces. For the mesh generation, an irregular mesh generation scheme is employed in which local mesh densities are assigned by the user along the boundaries of the analysis domain. For this purpose a looping algorithm combined with an advancing front technique using basic operators has been developed, in which the loops are recursively subdivided into subloops with the use of the best split lines and then the basic operators generate elements. Using the split lines, the original boundaries are split recursively until each loop contains a certain number of key nodes, and then using the basic operators such as type-1 and type-2, one or two triangular elements are generated at each operation. After the triangulation process has been completed for each meshing domain, the resulting meshes are finally improved by smoothing process. Sample meshes are presented to demonstrate the versatility of the algorithm.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.2
• /
• pp.149-159
• /
• 2001

The conventional block-based motion prediction suffers, especially in low bit-rate video application, from shortcomings such as blocking artifacts of motion field and unstable motion estimation. To overcome the deficiency, this paper proposes one method of adopting a new motion compensation scheme based on the irregular triangular mesh structure while keeping the current block-based DCT coding structure of H.263 as much as possible. To represent the reconstructed previous frame using minimal number of control points, the proposed method designs content-adaptive irregular triangular meshes, and then, estimate the motion vector of each control point using the affine transformation-based matching. The predicted current frame is obtained by applying the affine transformation to each triangular mesh. Experiment with the several real video sequences shows improvement both in objective and subjective picture quality over the conventional block-based H.263 method.

• Journal of computational fluids engineering
• /
• v.9 no.3
• /
• pp.73-80
• /
• 2004

A LS(Level Set) formulation is developed for computing two-phase flows on non- orthogonal meshes. Compared with the VOF(Volume-of-Fluid) method based on a non-smooth volume-fraction function, the LS method can calculate an interfacial curvature more accurately by using a smooth distance function. Also, it is quite straightforward to implement for 3-D irregular meshes compared with the VOF method requiring much more complicated geometric calculations. The LS formulation is implemented into a general purpose program for 3-D flows and verified through several test problems.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.35 no.6
• /
• pp.561-567
• /
• 2011

The inverse radiation analysis of a two-dimensional irregular configuration using unstructured triangular meshes is presented. In this study, an enclosure filled with an absorbing, emitting and scattering medium with diffusely emitting and reflecting opaque boundaries is considered. The finite volume method is applied to solve the radiative transfer equation in order to simulate the measured incident radiation values which are used as input data for the inverse analysis. The conjugate gradient method is adopted for the estimation of wall emissivities by minimizing the objective function at each iteration step. To verify the performance of the unstructured grid system, we compare the results with those using a structured grid system for the two-dimensional lopsided shape. The effect of measurement errors on the estimation accuracy is also investigated.

• Structural Engineering and Mechanics
• /
• v.43 no.3
• /
• pp.349-370
• /
• 2012

Variable-node finite element families, termed (4 + k + l + m + n)-node elements with an arbitrary number of nodes (k, l, m, and n) on each of their edges, are developed based on the generic point interpolation with special bases having slope discontinuities in two-dimensional domains. They retain the linear interpolation between any two neighboring nodes, and passes the standard patch test when subdomain-wise $2{\times}2$ Gauss integration is employed. Their shape functions are automatically generated on the master domain of elements although a certain number of nodes are inserted on their edges. The elements can provide a flexibility to resolve nonmatching mesh problems like mesh connection and adaptive mesh refinement. In the case of adaptive mesh refinement problem, so-called "1-irregular node rule" working as a constraint in performing mesh adaptation is relaxed by adopting the variable-node elements. Through several examples, we show the performance of the variable-node finite elements in terms of accuracy and efficiency.

• Journal of Advanced Marine Engineering and Technology
• /
• v.23 no.1
• /
• pp.9-18
• /
• 1999

The present study is aimed to investigate flow characteristics of two-dimensional backward-fac-ing step by numerical approach. A convection conservation difference scheme based upon SOLA algorithm is used for the solution of the two-dimensional incompressible Navier-Stokes equations to simulate the laminar transitional and trubulent flow conditions at which the experimental data can be available for the backlward-facing step. The twenty kinds of reynolds number are used for the calculations. In an effort to demonstrate that the reported solutions are dependent on the mesh refinement computations are performed on seven different meshes of uniformly increasing refinement. also to investigate the result of inflow dependence two kinds of the inflow profile are chosen for the laminar flow. Irregular grid is adopted to minimize the errors on the satis-faction fo the discretized continuity. As criterion of benchmarking the result of numerical simula-tion reattachment lengthis used for the selected Reynolds numbers. The results of the present study prove the fact that the numerical predictions agree well with the experimental data and the flow characteristics are shown at the backward-facing step.

• The Journal of the Korea Contents Association
• /
• v.9 no.5
• /
• pp.76-83
• /
• 2009

This paper presents a compression method for animated meshes or mesh sequences which have a shared connectivity and geometry streams. Our approach is based on static semi-regular mesh compression algorithm introduced by Khodakovky et al. Our encoding algorithm consists of two stages. First, the proposed technique creates a semi-regular mesh sequence from an input irregular mesh sequence. For semi-regular remeshing of irregular mesh sequences, this paper adapts the MAPS algorithm. However, MAPS cannot directly be performed to the input irregular mesh sequence. Thus, the proposed remesh algorithm revises the MAPS remesher using the clustering information, which classify coherent parts during the animation. The second stage uses wavelet transformation and clustering information to compress geometries of mesh sequences efficiently. The proposed compression algorithm predicts the vertex trajectories using the clustering information and the cluster transformation during the animation and compress the difference other frames from the reference frame in order to reduce the range of 3D position values.