• International Journal of CAD/CAM
• /
• v.1 no.1
• /
• pp.11-21
• /
• 2002

This paper presents a triangular-to-quadrilateral mesh conversion method that can control the directionality of the output quadrilateral mesh according to a user-specified vector field. Given a triangular mesh and a vector field, the method first scores all possible quadrilaterals that can be formed by pairs of adjacent triangles, according to their shape and directionality. It then converts the pairs into quadrilateral elements in order of the scores to form a quadrilateral mesh. Engineering analyses with finite element methods occasionally require a quadrilateral mesh well aligned along the boundary geometry or the directionality of some physical phenomena, such as in the directions of a streamline, shock boundary, or force propagation vectors. The mesh conversion method can control the mesh directionality according to any desired vector fields, and the method can be used with any existing triangular mesh generators.

• Journal of computational fluids engineering
• /
• v.2 no.2
• /
• pp.26-34
• /
• 1997

An implicit viscous turbulent flow solver is developed for two-dimensional geon unstructured triangular meshes. The flux terms are discretized based on a cell-centered formulation with the Roe's flux-difference splitting. The solution is advanced in time us backward-Euler time-stepping scheme. At each time step, the linear system of equation approximately solved wi th the Gauss-Seidel relaxation scheme. The effect of turbulence is with a standard k-ε two-equation model which is solved separately from the mean flow equation the same backward-Euler time integration scheme. The triangular meshes are generated advancing-front/layer technique. Validations are made for flows over the NACA 0012 airfoil. Douglas 3-element airfoil. Good agreements are obtained between the numerical result experiment.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.39 no.9
• /
• pp.921-927
• /
• 1990

This paper presents a mesh refinement scheme for 3-D adaptive finite element method. Firstly, the refinement of triangular meshes based on the bisection of triangles is discussed. And a new method to refine tetrahedral meshes employing the bisection method is presented. In two dimensional cases, it has been noted that all angles in the triangular meshes refined by the bisection method are greater than or equal to half the smallest angle in the original meshes. Through the examples where the newly proposed method is applied to three dimensional cases, it is shown that regarding the solid angles, the method gives nearly the same result as that in the two dimensional case. Accordingly, it can be concluded that the proposed method will be useful in the mesh refinements for 3-D adaptive finite element method.

• 한국전산유체공학회:학술대회논문집
• /
• 1997.10a
• /
• pp.55-60
• /
• 1997

An unstructured finite volume method is presented for seeking steady and unsteady flow solutions of the two-dimensional incompressible viscous flows. In the present method, SMAC-type algorithm is implemented on unstructured triangular meshes, using second order upwind scheme for the convective fluxes. Validation tests are made for various steady and unsteady incompressible flows. Convergence characteristics are examined and accuracy comparisons are made with some benchmark solutions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.3
• /
• pp.575-591
• /
• 2011

We present a novel active contour-based two-pass approach to extract smooth feature regions from a triangular mesh. In the first pass, an active contour formulated in level-set surfaces is devised to extract feature regions with rough boundaries. In the second pass, the rough boundary curve is smoothed by minimizing internal energy, which is derived from its curvature. The separation of the extraction and smoothing process enables us to extract feature regions with smooth boundaries from a triangular mesh without user's initial model. Furthermore, smooth feature curves can also be obtained by skeletonizing the smooth feature regions. We tested our algorithm on facial models and proved its excellence.

• Journal of computational fluids engineering
• /
• v.9 no.1
• /
• pp.48-56
• /
• 2004

The numerical simulations with unstructured mesh by cell-centered and vertex-centered approaches were peformed for the quadrilateral and triangular meshes. For 2-D inviscid supersonic vortex flow, the simulation results and the analytic solution were compared and the accuracy was assessed. The calculation efficiency was measured by the parameter defined by the consumed CPU time multiplied by absolute error As a results, equilateral triangular mesh yielded the best accuracy and efficiency among the tested meshes. Cell-centered approach gives a little better efficiency than vertex - centered approach.

• 한국전산유체공학회:학술대회논문집
• /
• 1997.10a
• /
• pp.29-37
• /
• 1997

An implicit viscous turbulent flow solver is developed for two-dimensional geometries on unstructured triangular meshes. The flux terms are discretized based on a cell-centered finite-volume formulation with the Roe's flux-difference splitting. The solution is advanced in time using an implicit backward-Euler time-stepping scheme. At each time step, the linear system of equations is approximately solved with the Gauss-Seidel relaxation scheme. The effect of turbulence effects is approximated with a standard $k-{\varepsilon}$ two-equation model which is solved separately from the mean flow equations using the same backward-Euler time integration scheme. The triangular meshes are generated using an advancing-front/layer technique. Validations are made for flows over the NACA0012 airfoil and the Douglas 3-element airfoil. Good agreements are obtained between the numerical results and the experiment.

• 한국전산유체공학회:학술대회논문집
• /
• 2003.08a
• /
• pp.25-30
• /
• 2003

The numerical simulations with unstructured mesh by cell-centered and vertex-centered approaches were performed for the quadrilateral and triangular meshes. For the 2-D incompressible supersonic vortex flow, the simulation results and the analytic solution were compared and the accuracy was assessed. The calculation efficiency was measured by the parameter defined by the consumed CPU time multiplied by absolute error, As a results, equilateral triangular mesh yielded the best accuracy and efficiency among the tested meshes.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.36 no.6
• /
• pp.499-505
• /
• 2018

Most of 3D indoor spatial data recently constructed by many projects merely focus on the visualization rather than geospatial information applications. The 3D indoor data for visualization in 3DS or COLLADA format are based on triangular mesh representation. In order to implement meaningful applications, we need however more meaningful information in 3D indoor spatial data than visualization data in triangular meshes. For this reason, an OGC (Open Geospatial Consortium) standard, called IndoorGML(Indoor Geographic Markup Language) was published to meet the requirements on 3D indoor spatial data for several geospatial applications for indoor space more than simple visualization. It means that it becomes a critical functional requirement to convert triangular mesh representation in 3DS or COLLADA to IndoorGML. In this paper we propose a framework of the conversion, which consists of geometric, topological, and semantic construction of data from triangular meshes. An experiment carried out to validate the proposed framework is also presented in the paper.

• Korean Journal of Computational Design and Engineering
• /
• v.19 no.1
• /
• pp.61-67
• /
• 2014

This paper proposes a procedure enabling the extraction of view-dependent triangular approximations from a height map. In general, procedures to approximate a height map use tree hierarchies. These methods, however, have a limitation in terms of accuracy, because they depend on tree hierarchy than terrain features. To overcome the difficult, we apply the simplification method for triangular meshes to a height map. The proposed procedure maintains full decimation procedure to support multiresolution. The maintenance of decimation procedure results in creation of the groups (trees), each of which consists of vertices that can be merged into one vertex (root node). As the groups have tolerance which is determined by some tests, they support the generation of view-dependent arbitrary triangular meshes.