• 제목/요약/키워드: Regular triangular grid

검색결과 6건 처리시간 0.016초

화음탐색 알고리즘을 이용한 네트워크 돔의 정삼각형 격자 조절기법 (An Arrangement Technique for Fine Regular Triangle Grid of Network Dome by Using Harmony Search Algorithm)

  • 손수덕;조혜원;이승재
    • 한국공간구조학회논문집
    • /
    • 제15권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.

3차원 8분할 Delaunay 삼각화 알고리즘 개발 (Development of Delaunay Triangulation Algorithm Using Oct-subdivision in Three Dimensions)

  • 박시형;이성수
    • 한국CDE학회논문집
    • /
    • 제10권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.

삼각형 메쉬 상에서의 미분 연산자와 그 응용 (Differential Operators on a Triangular Mesh and Their Applications)

  • 백승엽;감동욱;이건우
    • 한국CDE학회논문집
    • /
    • 제20권1호
    • /
    • pp.44-54
    • /
    • 2015
  • Solving partial differential equations (PDEs) on a manifold setting is frequently faced problem in CAD, CAM and CAE. However, unlikely to a regular grid, solutions for those problems on a triangular mesh are not available in general, as there are no well-established intrinsic differential operators. Considering that a triangular mesh is a powerful tool for representing a highly-complicated geometry, this problem must be tackled for improving the capabilities of many geometry processing algorithms. In this paper, we introduce mathematically well-defined differential operators on a triangular mesh setup, and show some examples of their applications. Through this, it is expected that many CAD/CAM/CAE application will be benefited, as it provides a mathematically rigorous solution for a PDE problem which was not available before.

방향성을 갖는 비정렬 삼각형격자를 이용한 단조 유선 Upwind 유한요소해석 (The Monotone Streamline Upwind Finite Element Method Using Directionally Aligned Unstructured Grids)

  • 지선구;권장혁
    • 한국전산유체공학회:학술대회논문집
    • /
    • 한국전산유체공학회 1997년도 추계 학술대회논문집
    • /
    • pp.49-54
    • /
    • 1997
  • Rice's monotone streamline upwind finite element method, which was proposed to treat convection-dominated flows, is applied to the linear triangular element. An alignment technique of unstructured grids with given velocity fields is used to prevent the interpolation error produced in evaluating the convection term in the upwind method. The alignment of grids is accomplished by optimizing a target function defined with the inner-product of a properly chosen side vector in the element with the velocity field. Two pure advection problems are considered to demonstrate the superiorities of the present approach in solving the convection-dominated flow on the unstructured grid. Solutions obtained with aligned grids are much closer to the exact solutions than those with initial regular grids. The capability of the present approach in predicting the appearance of the secondary vortex in the laminar confined jet impingement is shown by comparing streamlines to those produced by SIMPLE on a highly stretched grid toward the impingement plate.

  • PDF

프랙탈 차원 추정을 위한 박스 계수법의 개선 (Enhancement of the Box-Counting Algorithm for Fractal Dimension Estimation)

  • 소혜림;소건백;진강규
    • 제어로봇시스템학회논문지
    • /
    • 제22권9호
    • /
    • pp.710-715
    • /
    • 2016
  • Due to its simplicity and high reliability, the box-counting(BC) method is one of the most frequently used techniques to estimate the fractal dimensions of a binary image with a self-similarity property. The fractal calculation requires data sampling that determines the size of boxes to be sampled from the given image and directly affects the accuracy of the fractal dimension estimation. There are three non-overlapping regular grid methods: geometric-step method, arithmetic-step method and divisor-step method. These methods have some drawbacks when the image size M becomes large. This paper presents a BC algorithm for enhancing the accuracy of the fractal dimension estimation based on a new sampling method. Instead of using the geometric-step method, the new sampling method, called the coverage ratio-step method, selects the number of steps according to the coverage ratio. A set of experiments using well-known fractal images showed that the proposed method outperforms the existing BC method and the triangular BC method.

Adaptive Mesh Refinement Using Viscous Adjoint Method for Single- and Multi-Element Airfoil Analysis

  • Yamahara, Toru;Nakahashi, Kazuhiro;Kim, Hyoungjin
    • International Journal of Aeronautical and Space Sciences
    • /
    • 제18권4호
    • /
    • pp.601-613
    • /
    • 2017
  • An adjoint-based error estimation and mesh adaptation study is conducted for two-dimensional viscous flows on unstructured hybrid meshes. The error in an integral output functional of interest is estimated by a dot product of the residual vector and adjoint variable vector. Regions for the mesh to be adapted are selected based on the amount of local error at each nodal point. Triangular cells in the adaptive regions are refined by regular refinement, and quadrangular cells near viscous walls are bisected accordingly. The present procedure is applied to single-element airfoils such as the RAE2822 at a transonic regime and a diamond-shaped airfoil at a supersonic regime. Then the 30P30N multi-element airfoil at a low subsonic regime with a high incidence angle (${\alpha}=21deg.$) is analyzed. The same level of prediction accuracy for lift and drag is achieved with much less mesh points than the uniform mesh refinement approach. The detailed procedure of the adjoint-based mesh refinement for the multi-element airfoil case show that the basic flow features around the airfoil should be resolved so that the adjoint method can accurately estimate an output error.