• 한국CDE학회논문집
• /
• 제7권4호
• /
• pp.248-253
• /
• 2002

Delaunay triangulation is well balanced in the sense that the triangles tend toward equiangularity. And so, Delaunay triangulation hasn't some slivers triangle. It's commonly used in various field of CAD applications, such as reverse engineering, shape reconstruction, solid modeling and volume rendering. For Example, In this paper, an improved Delaunay triangulation is proposed in 2-dimensions. The suggested algorithm subdivides a uniform grids into sub-quad grids, and so efficient where points are nonuniform distribution. To get the mate from quad-subdivision algorithm, the area where triangulation-patch will be most likely created should be searched first.

• 대한기계학회논문집A
• /
• 제20권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.

• 한국전산유체공학회지
• /
• 제2권2호
• /
• pp.97-103
• /
• 1997

A modified Delaunay triangulation technique is tested for complicated computational domain. While a simple geometry. both in topology and geometry, has been well discretized into triangular elements, a complex geometry having difficulty in triangulation had to be divided into small sub-domains of simpler shape. The present study presents a modified Delaunay triangulation method based on the data structure of geometric modeller. This approach greatly enhances the reliability of triangulation, especially in complicated computational domain. We have shown that efficiency of Delaunay triangulation can be much improved by using both the GUI (Graphic User Interface) and OOP (Object-Oriented Programming).

• 한국생산제조학회지
• /
• 제8권3호
• /
• pp.35-41
• /
• 1999

STL which is used in Rapid Prototyping is composed of a lot of triangular facets. The number of triangles and the shapes of these triangles determine the quality of STL. Therefore, proper algorithm is necessary to enhance the quality of triangular patch. In this paper we used the Delaunay triangulation method to apply to following processes. 1) On processing for reducing sharp triangles which cause errors on intersection. 2) On processing for connecting two or more collinear edges. 3) On processing for deleting unnecessarily inserted points in coplanar polygon.

• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 2000년도 추계학술대회논문집 - 한국공작기계학회
• /
• pp.151-156
• /
• 2000

Delaunay triangulation is well balanced in the sense that the triangles tend toward equiangularity. And so, Delaunay triangulation hasn't some slivers triangle. It's commonly used in various field of CAD applications, such as shape reconstruction, solid modeling and volume rendering. In this paper, an improved Delaunay triangulation is proposed in 2-dimensions. The suggested algorithm subdivides a uniform grids into sub-quad grids, and so efficient where points are non-uniform distribution. To get the mate from quad-subdivision algorithm, the area where triangulation-patch will be most likely created should be searched first.

• 한국CDE학회논문집
• /
• 제22권2호
• /
• pp.110-117
• /
• 2017

Delaunay refinement algorithm is a classical method to generate quality triangular meshes when point cloud and/or constrained edges are given in two- or three-dimensional space. It computes the Delaunay triangulation for given points and edges to obtain an initial solution, and update the triangulation by inserting steiner points one by one to get an improved quality triangulation. This process repeats until it satisfies given quality criteria. The efficiency of the algorithm depends on the criteria and point insertion method. In this paper, we propose a method to accelerate the Delaunay refinement algorithm by applying geometric hashing technique called bucketing when inserting a new steiner point so that it can localize necessary computation. We have tested the proposed method with a few types of data sets, and the experimental result shows strong linear time behavior.

• 한국전산구조공학회논문집
• /
• 제14권4호
• /
• pp.525-535
• /
• 2001

본 연구에서는 무요소법의 일종인 element-free Galerkin 방법(EFGM)을 이용한 새로운 적응적 해석법을 제안하였다. 이 방법의 핵심은 Delaunay 삼각화에 기초를 둔 적분 격자를 기초로 수치적분과 적응적인 절점의 추가 및 소거를 수행하는 것이다. 이러한 적응적 해석법은 적분격자의 분할이나 이를 위한 추가적인 정보에 대한 관리가 필요 없이 간편하게 적응적 해석을 수행할 수 있다. 또한 균열의 진전과 같은 다단계 적응적 해석에 있어서도 매 해석단계별로 평가된 오차에 기초를 둔 최적 해석모델이 Delaunay 삼각화에 의해 구성되도록 하였다. 이러한 특성은 요소의 구성으로부터 자유로운 무요소법의 장점을 최대한 활용하여 해석모델의 구축을 보다 원활하게 수행할 수 있다. 적응적 해석에 기초가 되는 해석 후 오차평가는 계산된 응력과 투영응력과의 차이를 오차로 추정하는 투영응력법을 이용하였다. 균열진전을 포함하는 2차원예제의 해석을 수행한 결과 제안된 해석법의 타당성과 적용성을 입증할 수 있었다.

• 한국멀티미디어학회:학술대회논문집
• /
• 한국멀티미디어학회 2012년도 춘계학술발표대회논문집
• /
• pp.417-418
• /
• 2012

최소 신장 트리를 이용하여 멀티미디어 통신을 위한 네트워크를 구축하는 것보다 효과적인 유클리드 스타이너 트리 생성과정에서 필연적으로 발생되는 막대한 계산 량과 실행시간 문제를 해결하기 위해 Delaunay 삼각망을 적용하는 방법을 제안한다.

• 한국전산유체공학회:학술대회논문집
• /
• 한국전산유체공학회 2011년 춘계학술대회논문집
• /
• pp.194-198
• /
• 2011

In this study, an efficient algorithm for Delaunay triangulation of a number of points which can be used on a GPU-based parallel computation is studied The developed algorithm is programmed using CUDA library. and the program takes full advantage of parallel computation which are concurrently performed on each of the threads on GPU. The results of partitioned triangulation collected from the GPU computation requires proper stitching between neighboring partitions and calculation of connectivities among triangular cells on CPU In this study, the effect of number of threads on the efficiency and total duration for Delaunay grid generation is studied. And it is also shown that GPU computing using CUDA for Delaunay grid generation is feasible and it saves total time required for the triangulation of the large number points compared to the sequential CPU-based triangulation programs.

• 한국멀티미디어학회논문지
• /
• 제13권4호
• /
• pp.547-559
• /
• 2010

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