• Title/Summary/Keyword: triangular meshes

Search Result 103, Processing Time 0.028 seconds

Inverse Radiation Analysis of a Two-Dimensional Irregular Geometry Using Unstructured Triangular Meshes (비정렬 삼각 격자를 이용한 2 차원 비직교 형상에서의 역복사 해석)

  • Yi, Kyung-Joo;Baek, Seung-Wook;Kim, Man-Young
    • 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.

Cloth simulation using a particle system on triangular mesh (삼각 메쉬 파티클 시스템을 이용한 직물 시뮬레이션)

  • Noh, Jae-Hee;Jung, Moon-Ryul
    • Journal of the Korea Computer Graphics Society
    • /
    • v.16 no.3
    • /
    • pp.31-39
    • /
    • 2010
  • The particle system based on quad mesh has been posed to model cloth. But we need to develop cloth models on triangular meshes because they are widely used. Cloth modeling on triangular mesh is often done in the style of finite element method, which assumes that material is continuous. To preserve the advantages of particle system, e.g. model simplicity and the ease of implementation, even on triangular mesh, this paper proposes a particle system on triangular mesh. The motion of cloth is modeled so that vertices interact with each other via the edges on the triangular mesh. The interactions of vertices are assumed to exist between every adjacent vertex and between every other vertex. The deformation energy due to interaction is constructed based on the theory of elasticity. The contribution of the paper is to implement the advantages of particle system on triangular mesh.

A P-HIERARCHICAL ERROR ESTIMATOR FOR A FEM-BEM COUPLING OF AN EDDY CURRENT PROBLEM IN ℝ3 -DEDICATED TO PROFESSOR WOLFGANG L. WENDLAND ON THE OCCASION OF HIS 75TH BIRTHDAY

  • Leydecker, Florian;Maischak, Matthias;Stephan, Ernst P.;Teltscher, Matthias
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.17 no.3
    • /
    • pp.139-170
    • /
    • 2013
  • We extend a p-hierarchical decomposition of the second degree finite element space of N$\acute{e}$d$\acute{e}$lec for tetrahedral meshes in three dimensions given in [1] to meshes with hexahedral elements, and derive p-hierarchical decompositions of the second degree finite element space of Raviart-Thomas in two dimensions for triangular and quadrilateral meshes. After having proved stability of these subspace decompositions and requiring certain saturation assumptions to hold, we construct a local a posteriori error estimator for fem and bem coupling of a time-harmonic electromagnetic eddy current problem in $\mathbb{R}^3$. We perform some numerical tests to underline reliability and efficiency of the estimator and test its usefulness in an adaptive refinement scheme.

User-Steered Extraction of Geometric Features for 3D Triangular Meshes (사용자 의도에 의한 삼차원 삼각형 메쉬의 기하적 특징 추출)

  • Yoo, Kwan-Hee;Ha, Jong Sung
    • Journal of the Korea Computer Graphics Society
    • /
    • v.9 no.2
    • /
    • pp.11-18
    • /
    • 2003
  • For extracting geometric features in 3D meshes according to user-steering with effective interactions. this paper generalizes the 2D algorithms of snapping and wrapping that. respectively. moves a cursor to a nearby feature and constructs feature boundaries. First. we define approximate curvatures and move cost functions that are the numerical values measuring the geometric characteristics of the meshes, By exploiting the measuring values. the algorithms of geometric snapping and geometric wrapping are developed and implemented. We also visualize the results from applying the algorithms to extracting geometric features of general 3D mesh models such as a face model and a tooth model.

  • PDF

Development of 3-D Flow Analysis Code Using Unstructured Grid System (II) - Code's Performance Evaluation - (비정렬격자계를 사용하는 3차원 유동해석코드 개발 (II) - 코드성능평가 -)

  • Kim, Jong-Tae;Kim, Jong-Eun;Myong, Hyon-Kook
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.29 no.9 s.240
    • /
    • pp.1057-1064
    • /
    • 2005
  • A conservative finite-volume numerical method using unstructured meshes, which is developed by the authors, is evaluated for its application to several 2-D benchmark problems using a variety of quadrilateral, triangular and hybrid meshes. The present pressure-based numerical method for unstructured mesh clearly demonstrates the same accuracy and robustness as that fur typical structured mesh.

Two-Dimensional Adaptive Mesh Generation Algorithm and its Application with Higher-Order Compressible Flow Solver

  • Phongthanapanich, Sutthisak;Dechaumphai, Pramote
    • Journal of Mechanical Science and Technology
    • /
    • v.18 no.12
    • /
    • pp.2190-2203
    • /
    • 2004
  • A combined procedure for two-dimensional Delaunay mesh generation algorithm and an adaptive remeshing technique with higher-order compressible flow solver is presented. A pseudo-code procedure is described for the adaptive remeshing technique. The flux-difference splitting scheme with a modified multidimensional dissipation for high-speed compressible flow analysis on unstructured meshes is proposed. The scheme eliminates nonphysical flow solutions such as the spurious bump of the carbuncle phenomenon observed from the bow shock of the flow over a blunt body and the oscillation in the odd-even grid perturbation in a straight duct for the Quirk's odd-even decoupling test. The proposed scheme is further extended to achieve higher-order spatial and temporal solution accuracy. The performance of the combined procedure is evaluated on unstructured triangular meshes by solving several steady-state and transient high-speed compressible flow problems.

Automatic Mesh Generation by Delaunay Triangulation and Its Application to Remeshing (Delaunay 삼각화기법을 이용한 유한요소망의 자동생성과 격자재구성에의 응용)

  • Jeong, Hyeon-Seok;Kim, Yong-Hwan
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.20 no.2
    • /
    • pp.553-563
    • /
    • 1996
  • An algorithm for automatic mesh generation of two-dimensional arbitrary planar domain is proposed by using Delaunay triangulation algorithm. An efficient algorithm is proposed for the construction of Delaunay triangulation algorithm over convex planar domain. From the definition of boundary, boundary nodes are first defined and then interior nodes are generated ensuring the Delaunay property. These interior nodes and the boundary nodes are then linked up together to produce a valid triangular mesh for any finite element analysis. Through the various example, it is found that high-quality triangular element meshes are obtained by Delaunay algorithm, showing the robustness of the current method. The proposed mesh generation scheme has been extended to automatic remeshing, which is applicable to FE analysis including large deformation and large distortion of elements.

A fast capacitance extraction algorithm for multiple 3-dimensional conductors with dielectrics using adaptive triangular mesh (적응요소 MLFMA를 이용한 유전체가 포함된 3차원 구조의 정전용량계산)

  • Kim, Han;Ahn, Chang-Hoi
    • Proceedings of the Korea Electromagnetic Engineering Society Conference
    • /
    • 2001.11a
    • /
    • pp.140-144
    • /
    • 2001
  • This paper describes to extend the MLFMA(Multi-Level Fast Multipole Algorithm) for three-dimensional capacitance computation in the case of conductors embedded in an arbitrary dielectric medium. The triangular meshes are used and refined in the area which has heavy charge density. This technique is applied to the capacitance extraction of three-dimensional structures with multiple dielectrics. The results show good convergence with the comparable accuracy, and this adaptive technique coupled with MLFMA is useful to reduce computing time and the number of elements without additional computational efforts in large three dimensional problems.

  • PDF

Finite volume method for incompressible flows with unstructured triangular grids (비정렬 삼각격자 유한체적법에 의한 비압축성유동 해석)

  • ;;Kim, Jong-Tae;Maeng, Joo-Sung
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.19 no.11
    • /
    • pp.3031-3040
    • /
    • 1995
  • Two-dimensional incompressible Navier-Stokes equations have been solved by the node-centered finite volume method with the unstructured triangular 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. The convective fluxes are obtained by the Roe's flux difference splitting scheme using edge-based connectivities and higher-order differences are achieved by a reconstruction procedure. The time integration is based on an explicit four-stage Runge-Kutta scheme. Numerical procedures with local time stepping and implicit residual smoothing have been implemented to accelerate the convergence for the steady-state solutions. Comparisons with experimental data and other numerical results have proven accuracy and efficiency of the present unstructured approach.

Three Dimensional Shape Morphing of Triangular Net (삼각망의 3 차원 형상 모핑)

  • Yoo, Dong-Jin
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.25 no.1
    • /
    • pp.160-170
    • /
    • 2008
  • Shape morphing is the process of transforming a source shape, through intermediate shapes, into a target shape. Two main problems to be considered in three dimensional shape morphing are vertex correspondence and path interpolation. In this paper, an approach which uses the linear interpolation of the Laplacian coordinates of the source and target meshes is introduced for the determination of more plausible path when two topologically identical shapes are morphed. When two shapes to be morphed are different in shape and topology, a new method which combines shape deformation theory based on Laplacian coordinate and mean value coordinate with distance field theory is proposed for the efficient treatment of vertex correspondence and path interpolation problems. The validity and effectiveness of the suggested method was demonstrated by using it to morph large and complex polygon models including male and female whole body models.