• Proceedings of the KSME Conference
• /
• 2000.11a
• /
• pp.824-828
• /
• 2000

Prior to the downloading of the NC codes to a machining center, the NC tool-path can be verified in a computer. The Z-map is one of the tools for the verification of NC tool-path. The Z-map is a two dimensional array in which the height values of the Z-axis direction vectors are stored. The Z-axis direction vectors are arranged in a rectangular grid pattern on the XY plane. The accuracy of the simulation comes from the grid interval. In the rectangular Z-map, the distances between the grid points are different. The distance in diagonal direction is larger than those in X or Y axis directions. For the rendering of the Z-map, a rectangular grid is divided into two triangular facets. Depending on the selection of a diagonal, there are two different cases. In this paper, triangular Z-map, in which the Z-axis direction vectors are arranged in a triangular grid pattern on XY plane, is proposed. In the triangular Z-map, the distances between grid points are equal. There is no ambiguity to make triangular facets for the rendering.

• 한국전산유체공학회:학술대회논문집
• /
• 2007.04a
• /
• pp.103-107
• /
• 2007

Computational Fluid Dynamics (CFD in short) approach is now playing an important role in the engineering process recently. Generating proper grid system for the region of interest in time is prerequisite for the efficient numerical calculation of flow physics using CFD approach. Grid generation is, however, usually considered as a major obstacle for a routine and successful application of numerical approaches in the engineering process. CFD approach based on the unstructured grid system is gaining popularity due to its simplicity and efficiency for generating grid system compared to the structured grid approaches. In this paper an automated triangular surface grid generation using CAD surface data is proposed According to the present method, the CAD surface data imported in the STL format is processed to identify feature edges defining the topology and geometry of the surface shape first. When the feature edges are identified, node points along the edges are distributed. The initial fronts which connect those feature edge nodes are constructed and then they are advanced along the CAD surface data inward until the surface is fully covered by triangular surface grid cells using Advancing Front Method. It is found that this approach can be implemented in an automated way successfully saving man-hours and reducing human-errors in generating triangular surface grid system.

• Journal of computational fluids engineering
• /
• v.12 no.4
• /
• pp.68-73
• /
• 2007

Computational Fluid Dynamics (CFD) approach is now playing an important role in the engineering process in these days. Generating proper grid system in time for the region of interest is prerequisite for the efficient numerical calculation of flow physics using CFD approach. Grid generation is, however, usually considered as a major obstacle for a routine and successful application of numerical approaches in the engineering process. CFD approach based on the unstructured grid system is gaining popularity due to its simplicity and efficiency for generating grid system compared to the structured grid approaches, especially for complex geometries. In this paper an automated triangular surface grid generation using CAD(Computer Aided Design) surface data is proposed. According to the present method, the CAD surface data imported in the STL(Stereo-lithography) format is processed to identify feature edges defining the topology and geometry of the surface shape first. When the feature edges are identified, node points along the edges are distributed. The initial fronts which connect those feature edge nodes are constructed and then they are advanced along the CAD surface data inward until the surface is fully covered by triangular surface grid cells using Advancing Front Method. It is found that this approach can be implemented in an automated way successfully saving man-hours and reducing human-errors in generating triangular surface grid system.

• Korean Journal of Computational Design and Engineering
• /
• v.1 no.1
• /
• pp.56-64
• /
• 1996

A quadrilateral-triangular mixed grid method for the solution of incompressible viscous flow is presented. The solution domain near the body surface is meshed using elliptic grid geneator to acculately simulate the viscous flow. On the other hand, we used unstructured triangular grid system generated by advancing front technique of a simple automatic grid generation algorithm in the rest of the computational domain. The present method thus is capable of not only handling complex geometries but providing accurate solutions near body surface. The numerical technique adopted here is PISO type finite element method which was developed by the present author. Investigations have been made of two-dimensional unsteady flow of Re=550 past a circular cylinder. In the case of use of the unstructured grid only, there exists a considerable amount of difference with the existing results in drag coefficient and vorticity at the cylinder surface; this may be because of the lack of the grid clustering to the surface that is a inevitable requirement to resolve the viscous flow. However, numerical results on the mixed grid show good agreements with the earlier computations and experimental data.

• Journal of Korean Association for Spatial Structures
• /
• v.15 no.2
• /
• pp.87-94
• /
• 2015

This paper aimed at modeling a fine triangular grid for network dome by using Harmony Search (HS) algorithm. For this purpose, an optimization process to find a fine regular triangular mesh on the curved surface was proposed and the analysis program was developed. An objective function was consist of areas and edge's length of each triangular and its standard deviations, and design variables were subject to the upper and lower boundary which was calculated on the nodal connectivity. Triangular network dome model, which was initially consist of randomly irregular triangular mesh, was selected for the target example and the numerical result was analyzed in accordance with the HS parameters. From the analysis results of adopted model, the fitness function has been converged and the optimized triangular grid could be obtained from the initially distorted network dome example.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.33 no.8
• /
• pp.1-7
• /
• 2005

This paper proposes a local improvement method that combines extended topological clean up and optimization-based smoothing for homogenizing triangular grid system. First extended topological clean up procedures are applied to improve the connectivities of grid elements. Then, local optimization-based smoothing is performed for maximizing the distortion metric that measures grid quality. Using the local improvement strategy, we implement the grid homogenizations for two triangular grid examples. It is shown that the suggested algorithm improves the quality of the triangular grids to a great degree in an efficient manner and also can be easily applied to the remeshing algorithm in adaptive mesh refinement technique.

• Journal of the Korean Society for Precision Engineering
• /
• v.10 no.4
• /
• pp.81-93
• /
• 1993

The three dimensional(3D) shape reconstruction from two dimensional(2D) cross-sections can be completed through three main phases : the input compilation, the triangular grid formation, and the smooth surface construction. In the input compilation phase, the cross-sections are analyzed to exctract the input data required for the shape reconstruction. This data includes the number of polygonized contours per cross-section and the vertices defining each polygonized contour. In the triangular grid formation phase, a triangular grid, leading to a polyhedral approximations, is constructed by extracting all the information concerning contour links between two adjacent cross- sections and then performing the appropriate triangulation procedure for each contour link. In the smooth surface construction phase, a smooth composite surface interpolating all vertices on the triangular grid is constructed. Both the smooth surface and the polyhedral approximation can be used as reconstructed models of the object. This paper proposes a new method for reconstructing the geometric model of a 3D objdect from a sequence of planar contours representing 2D cross-sections of the objdect. The method includes the triangular grid formation algorithms for contour closing, one-to-one branching, and one-to-many braanching, and many-to-many branching. The shape reconstruction method has been implemented on a SUN workstation in C.

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

The Delaunay triangular net is primarily characterized by a balance of the whole by improving divided triangular patches into a regular triangle, which closely resembles an equiangular triangle. A triangular net occurring in certain, point-clustered, data is unique and can always create the same triangular net. Due to such unique characteristics, Delaunay triangulation is used in various fields., such as shape reconstruction, solid modeling and volume rendering. There are many algorithms available for Delaunay triangulation but, efficient sequential algorithms are rare. When these grids involve a set of points whose distribution are not well proportioned, the execution speed becomes slower than in a well-proportioned grid. In order to make up for this weakness, the ids are divided into sub-grids when the sets are integrated inside the grid. A method for finding a mate in an incremental construction algorithm is to first search the area with a higher possibility of forming a regular triangular net, while the existing method is to find a set of points inside the grid that includes the circumscribed sphere, increasing the radius of the circumscribed sphere to a certain extent. Therefore, due to its more efficient searching performance, it takes a shorer time to form a triangular net than general incremental algorithms.

• 한국전산유체공학회:학술대회논문집
• /
• 2009.11a
• /
• pp.65-70
• /
• 2009

In this paper a hybrid grid generation program for general 2-D region is introduced. The program is developed by using JAVA programming language, and it can be used either as an application program on a local computer or as an applet in the network environment. The hybrid grid system for a 2-D problem means a combination of triangular cells and quadrilateral cells, and it can offer both of the high flexibility of triangular cells and the high accuracy and efficiency of structured-type quadrilateral cells. To accommodate a quadrilateral-cell region and a triangular-cell region into one computational domain, it is importance to take good care of the interface between two different regions so that overall good grid quality can be maintained. In this research advancing layer method(ALM) augmented by elliptic smoothing method is used for the quadrilateral-cell region and advancing front method(AFM) is used for the triangular-cell region. A special treatment technique for the interface between those two regions is also developed. The interface treatment technique is basically to prevent the propagation of small cell size due to ALM method into the triangular region and maintain the smooth transition of cell-size scale between two different regions. By applying current technique high-quality hybrid grids for general 2-D regions can be easily generated, and typical grid generation results and flow solutions are demonstrated.

• Journal of computational fluids engineering
• /
• v.1 no.1
• /
• pp.88-97
• /
• 1996

This paper treats an adaptive finite-element method for the viscous compressible flow governed by Navier-Stokes equations in two dimensions. The numerical algorithm is the two-step Taylor-Galerkin mettled using unstructured triangular grids. To increase accuracy and stability, combined moving node method and grid refinement method have been used for grid adaption. Validation of the present algorithm has been made by comparing the present computational results with the existing experimental data and other numerical solutions. Four benchmark problems are solved for demonstration of the present numerical approach. They include a subsonic flow over a flat plate, the Carter flat plate problem, a laminar shock-boundary layer interaction. and finally a laminar flow around NACA0012 airfoil at zero angle of attack and free stream Mach number of 0.85. The results indicates that the present adaptive triangular grid method is accurate and useful for laminar viscous flow calculations.