• 제목/요약/키워드: Delaunay Triangulation

검색결과 134건 처리시간 0.022초

Delaunay 삼각화 기법을 활용한 다중-블록 정렬 격자의 자동 생성 기법 (Automatic Multi-Block Grid Generation Technique Based on Delaunay Triangulation)

  • 김병수
    • 한국전산유체공학회:학술대회논문집
    • /
    • 한국전산유체공학회 1999년도 추계 학술대회논문집
    • /
    • pp.108-114
    • /
    • 1999
  • In this paper. a new automatic multi=block grid generation technique for general 2D regions is introduced. According to this simple and robust method, the domain of interest is first triangulated by using Delaunay triangulation of boundary points, and then geometric information of those triangles is used to obtain block topology. Once block boundaries are obtained. structured grid for each block is generated such that grid lines have $C^0-continuity$ across inter-block boundaries. In the final step of the present method, an elliptic grid generation method is applied to smoothen grid distribution for each block and also to re-locale the inter-block boundaries, and eventually to achieve a globally smooth multi-block structured grid system with $C^1-continuity$.

  • PDF

Delaunay 삼각화에 의한 유한요소 자동 생성 코드 개발에 관한 연구 (Code Development of Automatic Mesh Generation for Finite Element Method Using Delaunay Triangulation Method)

  • 박병호;사종엽
    • 한국전산유체공학회:학술대회논문집
    • /
    • 한국전산유체공학회 1996년도 춘계 학술대회논문집
    • /
    • pp.111-117
    • /
    • 1996
  • The Delaunay triangulation technique was tested for complicated shapes of computational domain. While a simple geometry, both in topology and in geometry, was discretized well into triangular elements. a complex geometry often failed in triangularization. A complex geometry should be devided into smaller sub-domains whose shape is simple both topologically and geometrically. The present study developed the data structures not only for relationships among neibering elements but also for shape information, and coupled these into the Delaunay triangulation technique. This approach was able to enhance greatly the reliability of triangularization specially in complicated shapes of computational domains. The GUI (Graphic User Interface) and OOP (Object-Oriented Programming) were used in order to develop the user-friendly and efficient computer code.

  • PDF

화질 추정과 특징점 분류를 이용한 Delaunay 삼각화 기반의 지문 정합 알고리즘 (Delaunay Triangulation based Fingerprint Matching Algorithm using Quality Estimation and Minutiae Classification)

  • 성영진;김경환
    • 한국멀티미디어학회논문지
    • /
    • 제13권4호
    • /
    • pp.547-559
    • /
    • 2010
  • Delaunay 삼각화는 회전과 평행 이동에 강건하여 지문 인식에 적합하다. 그러나 특징점이 소실되거나 추가로 추출되는 경우 지문 인식 성능이 저하되고 계산 복잡도가 증가하게 된다. 본 논문에서는 지문 영상의 지역적 화질 척도 분석을 통해 저화질 영역을 설정하고, 추출된 특징점을 4개의 그룹으로 분류하여 정합과정에 이용함으로써 인식 성능을 개선하고 계산 복잡도를 감소시켰다. 정합 후보 영역에서의 저화질 영역 제거와 특징점 분류에 대한 실험을 통해 성능의 저하 없이 정합 소요 시간이 감소되는 것을 확인하였고, NIST에서 제공하는 정합 알고리즘 (BOZORTH3)보다 정합 성능이 향상되었음을 확인하였다.

Delaunay Triangulation의 폴리건 검색속도 개선을 위한 T-Search와 Dynamic-Window 개념의 결합 (Integration of T-Search and Dynamic-Window Concept for Accelerated Searching Speed in Delaunay Triangulation)

  • 강현주;윤석준;공지영;김강수
    • 대한기계학회논문집A
    • /
    • 제27권5호
    • /
    • pp.681-687
    • /
    • 2003
  • Terrain surfaces have to be modeled in very detail and wheel-surface contacting geometry must be well defined in order to obtain proper ground-reaction and friction forces fur realistic simulation of off-road vehicles. Delaunay triangulation is one of the most widely used methods in modeling 3-dimensional terrain surfaces, and the T-search is a relevant algorithm for searching resulting triangular polygons. The T-search method searches polygons in a successive order and may not allow real-time computation of off-road vehicle dynamics if the terrain is modeled with many polygons, depending on the computer performance used in the simulation. The dynamic T-search, which is proposed in this paper, combines conventional T-search and the concept of the dynmaic-window search which uses reduced searching windows or sets of triangular surface polygons at each frame by taking advantage of the information regarding dynamic charactereistics of a simulated vehicle. Numerical tests show improvement of searching speeds by about 5% for randomly distributed triangles. For continuous search following a vehicle path, which occurs in actual vehicle simulation, the searching speed becomes 4 times faster.

영재교육을 위한 수학적 모델링 프로그램의 개발 및 적용 :보로노이 다이어그램과 들로네 삼각분할을 중심으로 (Development and application of program for mathematically gifted students based on mathematical modeling : focused on Voronoi diagram and Delaunay triangulation)

  • 유홍규;윤종국
    • 한국수학교육학회지시리즈E:수학교육논문집
    • /
    • 제31권3호
    • /
    • pp.257-277
    • /
    • 2017
  • 본 연구의 주된 목적은 크게 두 가지로 나눌 수 있다. 첫째, 최근 수학적 모델링이 강조되는 상황에서 보로노이 다이어그램과 들로네 삼각분할을 주제로 영재교육을 위한 수학적 모델링 프로그램을 개발하는 것이다. 둘째, 본 연구에서 개발한 수학적 모델링 프로그램을 실제 영재교육 수업에 적용한 결과를 분석하여 수학적 모델링 수업을 설계하는 현직교사와 융합형 영재프로그램을 개발하는 영재교사에게 도움을 주고자 한다.

Constrained Delaunay Triangulation 균열 요소 생성 기법을 이용한 균열 해석 (Crack Analysis using Constrained Delaunay Triangulation Crack Mesh Generation Method)

  • 김연희;김연희;박정선
    • 항공우주시스템공학회지
    • /
    • 제18권3호
    • /
    • pp.17-26
    • /
    • 2024
  • 항공기 엔진은 비행 중 고온, 고압과 터빈 축의 회전으로 인한 응력이 발생한다. 이러한 하중으로 인해 구조 내/외부에 미세한 균열이 발생할 수 있다. 이는 구조적 결함으로 이어져 부품의 수명에 악영향을 줄 수 있다. 이러한 현상을 사전에 방지하고자 균열에 대한 유한요소해석이 진행된다. 하지만 이 과정은 반복적인 균열 모델링이 이루어져 많은 시간과 노력을 수반한다. 그러므로 본 논문에서는 유한요소모델 기반의 균열 모델링 기법을 개발하였다. 균열 모델링에는 점 간의 연결에 제한을 가지고 공간을 삼각 분할하는 Constrained Delaunay Triangulation(CDT)을 사용하였다. 반타원 균열을 가지는 평판과 원통형 용기에 대한 응력확대계수 비교를 통해 기법을 검증하였으며, 균열 해석에 유용함을 보였다.

역공학에서의 Delaunay 삼각형 분할에 의한 점 데이터 감소 (Point Data Reduction in Reverse Engineering by Delaunay Triangulation)

  • 이석희;허성민;김호찬
    • 대한기계학회논문집A
    • /
    • 제25권8호
    • /
    • pp.1246-1252
    • /
    • 2001
  • Reverse engineering has been widely used for the shape reconstruction of an object without CAD data and the measurement of clay or wood models for the development of new products. To generate a surface from measured points by a laser scanner, typical steps include the scanning of a clay or wood model and the generation of manufacturing data like STL file. A laser scanner has a great potential to get geometrical data of a model for its fast measuring speed and higher precision. The data from a laser scanner are composed of many line stripes of points. A new approach to remove point data with Delaunay triangulation is introduced to deal with problems during reverse engineering process. This approach can be used to reduce a number of measuring data from laser scanner within tolerance, thus it can avoid the time for handling point data during modelling process and the time for verifying and slicing STL model during RP process.

역공학에서의 Delaunay 삼각형 분할에 의한 STL 파일 생성 (STL Generation in Reverse Engineering by Delaunay Triangulation)

  • 이석희;김호찬;허성민
    • 대한기계학회논문집A
    • /
    • 제26권5호
    • /
    • pp.803-812
    • /
    • 2002
  • Reverse engineering has been widely used for the shape reconstruction of an object without CAD data and the measurement of clay or wood models for the development of new products. To generate a surface from measured points by a laser scanner, typical steps include the scanning of a clay or wood model and the generation of manufacturing data like STL file. A laser scanner has a great potential to get geometrical data of a model for its fast measuring speed and higher precision. The data from a laser scanner are composed of many line stripes of points. A new approach to remove point data with Delaunay triangulation is introduced to deal with problems during reverse engineering process. The selection of group of triangles to be triangulated based on the angle between triangles is used for robust and reliable implementation of Delaunay triangulation as preliminary steps. Developed software enables the user to specify the criteria for the selection of group of triangles either by the angle between triangles or the percentage of triangles reduced. The time and error for handling point data during modelling process can be reduced and thus RP models with accuracy will be helpful to automated process.

Delaunay triangulation을 이용한 3차원 의료영상 재구성에 관한 연구 (A study of three dimensional reconstruction of medical images based on the Delaunay triangulation)

  • 권의철;김동윤
    • 대한의용생체공학회:학술대회논문집
    • /
    • 대한의용생체공학회 1998년도 추계학술대회
    • /
    • pp.273-274
    • /
    • 1998
  • We construct a volume whose boundary is a tetrahedron with triangular faces intersecting the cutting planes along the given contours. This volume is obtained by calculating the Delaunay triangulation slice by slice, mapping 2D to 3D as tetrahedron. Also, eliminate extra-voronoi skeleton and non-solid tetrahedron. In this paper, we propose new method to eliminate non-solid tetrahedron based on the modified extra-voronoi skeleton path. This method enable us to do a compact tetrahedrisation and to reconstruct complex shapes.

  • PDF

Delaunay 삼각형분할법을 이용한 3차원복합형상의 역공학 (Reverse Engineering of 3D Compound Shapes using Delaunay Triangulation)

  • 조승현;조명우;김재도
    • 한국정밀공학회지
    • /
    • 제17권7호
    • /
    • pp.181-188
    • /
    • 2000
  • The objective of this research is to develop an efficient reverse engineering method of 3-dimensional compound surfaces for raped prototyping process. As a first step, several image processing techniques were applied to the measured data obtained using laser scanner. And the boundary information of the compound surface were extracted to divide the surface into several separate regions. As a next step, the Delaunay triangulation method were applied to reconstruct the surface based on the measured data and the boundary information. Finally, the STL file were created for the rapid prototyping process. Required simulations and experiments were performed and the results were analyzed to show the effectiveness of the proposed methods.

  • PDF