• Structural Engineering and Mechanics
• /
• v.3 no.4
• /
• pp.383-390
• /
• 1995

A 2-D four-noded finite element which contains a ${\lambda}$ singularity is developed. The new element is compatible with quadratic standard isoparametric elements. The element is tested on two different examples. In the first example, an edge crack problem is analyzed using two different meshes and different integration orders. The second example is a crack perpendicular to the interface problem which is solved for different material properties and in turn different singularity order ${\lambda}$. The results of those examples illustrate the efficiency of the proposed element.

• Proceedings of the KSME Conference
• /
• 2003.11a
• /
• pp.1769-1774
• /
• 2003

Reverse Engineering has wasted high cost and much of time because there were few softwares for supporting post-process of 3D scanning efficiently. However today Reverse Engineering is attracted by various researchers on a count of its practical use and gradually improved quality. Accordingly, many industries induce the technology of Reverse Engineering. For keeping with this general trend, the algorithms of generating meshes from 3D scanning data and visualizing their cross section are suggested in this research. It is expected that output data from the algorithms can be used in inspecting errors between product designs and their final products, and in finding a way to improve quality by considering ideal model data.

• Journal of Mechanical Science and Technology
• /
• v.19 no.12
• /
• pp.2213-2223
• /
• 2005

In order to reconstruct a full 3D human model in reverse engineering (RE), a 3D scanner needs to be placed arbitrarily around the target model to capture all part of the scanned surface. Then, acquired multiple scans must be registered and merged since each scanned data set taken from different position is just given in its own local co-ordinate system. The goal of the registration is to create a single model by aligning all individual scans. It usually consists of two sub-steps: rough and fine registration. The fine registration process can only be performed after an initial position is approximated through the rough registration. Hence an automated rough registration process is crucial to realize a completely automatic RE system. In this paper an automated rough registration method for aligning multiple scans of complex human face is presented. The proposed method automatically aligns the meshes of different scans with the information of features that are extracted from the estimated principal curvatures of triangular meshes of the human face. Then the roughly aligned scanned data sets are further precisely enhanced with a fine registration step with the recently popular Iterative Closest Point (ICP) algorithm. Some typical examples are presented and discussed to validate the proposed system.

• Journal of information and communication convergence engineering
• /
• v.9 no.3
• /
• pp.266-270
• /
• 2011

The advancement of technology enables smart phones or handheld devices to render complex 3D graphics. However, the processing power and memory of smart phones remain very limited to render high polygon and details 3D models especially on games which requires animation, physic engine, or augmented reality. In this paper, several techniques will be introduced to speed up the computation and reducing the number of vertices of the 3D meshes without losing much detail.

• Proceedings of the KSR Conference
• /
• 2011.10a
• /
• pp.119-127
• /
• 2011

This paper shows development of 1-3 dimensional hybrid mesh method to analysis flow induced by ultra-high speed vehicle inside a long distance tunnel. For three-dimensional analysis of the tunnel system many meshes are required. However it is not efficient to calculate the whole tunnel system in three-dimension. Therefore in this paper, three-dimension meshes was used to describe stations, shafts and around vehicle, and one-dimension meshes was used to describe the tunnel except these three sections. And unsteady flow analysis of the ultra-high speed vehicle was performed with UDFs in commercial software, Ansys vr. 12.0.

• The Bulletin of The Korean Astronomical Society
• /
• v.40 no.1
• /
• pp.50.1-50.1
• /
• 2015

We present a new hydrodynamic simulation based on the unstructured moving mesh scheme. The simulation utilizes the Voronoi tessellation technique that produces polygonal cells composed of, on average, 13 surfaces each in 3D. We devise the incremental expanding method (IEM) and hybrid-neighbor searching algorithm and achieve the CPU time just proportional to the number of particles, i.e., O(N). We show the results of requisite tests for hydrodynamic simulations and demonstrate superiority of our code over the conventional codes using the stationary meshes. The applications in the context of cosmological and galactic simulations are also discussed.

• 한국전산유체공학회:학술대회논문집
• /
• 1999.05a
• /
• pp.90-97
• /
• 1999

An implicit turbulent flow solver is developed for 2-D unstructured hybrid meshes. Spatial discretization is accomplished by a cell-centered finite volume formulation using an upwind flux differencing. Time is advanced by an implicit backward Euler time stepping scheme. Flow turbulence effects are modeled by the Spalart-Allmaras one equation model, which is coupled with wall function. The numerical method is applied for flows on a flat plate, the NACA 0012 airfoil, and the Douglas 3 element airfoil. The results are compared with experimental data.

• 한국전산유체공학회:학술대회논문집
• /
• 1996.05a
• /
• pp.33-39
• /
• 1996

An incompressible flow stover based on the unstructured finite volume method has been developed. The flow domain is discretized by triangles in 2D or tetrahedra in 3D. The convective and viscous fluxes are obtained using edge connectivities of the unstructured meshes. The pressure-velocity coupling is handled by the artificial compressibility algorithm due to its computational efficiency associated with the hyperbolic nature of the resulting equations. Laminar test flow problems are computed and presented with a comparison against other numerical solutions or experimental results.

• Proceedings of the Korean Nuclear Society Conference
• /
• 1996.05a
• /
• pp.137-141
• /
• 1996

A new general high order consistent nodal method for solving the 3-D multigroup neutron kinetic equations in (x-y-z) geometry has been derived by expending the flux in a multiple polynomial series for the space variables by without the quadratic fit approximations of the transverse leakage and for the time variable and using a weighted-integral technique. The derived equation set is consistent mathematically, and therefore, we can expect very accurate solutions and less computing time since we can use coarse meshes in time variable as well as in spatial variables and the solution would converge exactly in fine mesh limit.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.2
• /
• pp.169-176
• /
• 2000

This paper is considered with the problem of embedding complete binary trees into 3-dimensional meshes using dimension-ordered routing with primary concern of minimizing link congestion. The authors showed that a complete binary tree with $2^P-1$ nodes can be embedded into a 3-dimensional mesh with optimum size, $2^P$ nodes, if the link congestion is two[14], (More precisely, the link congestion of each dimension is two, two, and one if the dimension-ordered routing is used, and two, one, and one if the dimension-ordered routing is not imposed.) In this paper, we present a scheme to find an embedding of a complete binary tree into a 3-dimensional mesh of size no larger than 1.27 times the optimum with link congestion one while using dimension-ordered routing.