• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10b
• /
• pp.202-205
• /
• 2007

본 논문에서는 3D 점집합으로부터 3D 메쉬를 생성하는 효율적인 기법을 소개한다. 대표적인 3D 삼각화 방법으로 3D Delaunay 삼각화 기법이 있으나 물체의 표면만을 고려한 메쉬 생성을 위한 방법으로 비효율적인 측면이 있다. 본 논문에서는 적은 계산량으로 물체의 표면 메쉬를 생성하는 기법을 소개한다. 물체의 각 영역을 분할하고 각 영역에 대해서 2D Delaunay 삼각화를 적용하여 3D 메쉬 구조를 얻는다. 3차원 점 집합에 대해 OBB를 계산하고 이를 기준으로 점집합을 다양한 각도에서 자르고 각 부분 점집합에 대해서 2D Delaunay 삼각화를 실시한다. 절단하는 각도의 간격이나 폭은 원래의 3D 점집합에서의 가장 가까운 이웃점들까지의 평균 거리를 이용하여 결정하도록 하였다. 후처리 과정으로 삼각 분할과정에서 잘못된 에지의 연결을 제거함으로써 객체의 삼각 분할 결과를 향상시킨다. 제안된 메쉬 생성 기법은 다양한 영상 기반 모델링 응용에서 효과적으로 적용될 수 있다.

• Journal of the Korea Computer Graphics Society
• /
• v.13 no.4
• /
• pp.21-27
• /
• 2007

The 3D Delaunay triangulation is the most widely used method for the mesh creation via the triangulation of a 3D point cloud. However, the method involves a heavy computational cost and, hence, in many interactive applications, it is not appropriate for surface triangulation. In this paper, we propose an efficient triangulation method to create a surface mesh from a 3D point cloud. We divide a set of object points into multiple subsets and apply the 2D Delaunay triangulation to each subset. A given 3D point cloud is cut into slices with respect to the OBB(Oriented Bounding Box) of the point set. The 2D Delaunay triangulation is applied to each subset producing a partial triangulation. The sum of the partial triangulations constitutes the global mesh. As a postprocessing process, we eliminate false edges introduced in the split steps of the triangulation and improve the results. The proposed method can be effectively applied to various image-based modeling applications.

• Journal of Digital Contents Society
• /
• v.19 no.1
• /
• pp.213-220
• /
• 2018

Face morphing, one of the most powerful image processing techniques that are often used in image processing and computer graphic fields, as it is a technique to change the image progressively and naturally from the original image to the target image. In this paper, we propose a method to generate Delaunay triangles using the facial landmark vertices generated by the Dlib face landmark detector and to implement morphing through warping and cross dissolving of Delaunay triangles between the original image and the target image. In this paper, we generate vertex points for face not manually but automatically, which is the major feature of the face such as eye, eyebrow, nose, and mouth, and is used to generate Delaunay triangles automatically which is the main characteristic of our face morphing method. Simulations show that we can add vertices manually and get more natural morphing results.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2007.05a
• /
• pp.398-402
• /
• 2007

본 연구에서는 삼각 요소망을 구성하는데 사용되는 기존의 Delaunay Triangulation 기법 외에 Advanced Front Technique 알고리즘을 적용하여 하천의 경계가 중요시되는 해석 모델에 적합한 삼각 요소망을 생성하고자 한다. Advanced Front Technique 알고리즘은 외부 경계를 따라 삼각 요소를 형성하기 시작하여 전체 해석 영역으로 요소를 채워가는 방법이다. 이 방법은 위에서 언급한 Delaunay Triangulation 기법의 단점인 해석 영역의 경계에서 요소의 형질이 좋지 못한 문제를 극복할 수 있을 뿐만 아니라, 미리 절점을 생성하지 않으므로 메모리를 절약하는 효과도 얻게 된다. Advanced Front Technique 알고리즘은 외부 경계의 노드(i)와 노드(i+1)을 Front로 하고, 이등변삼각형을 이루기 위해 해석 영역 내부의 적절한 위치에 새로운 절점(C)을 생성한다. 이렇게 Front와 새로운 절점(C)으로 이루어진 이등변 삼각형 요소가 생성된 후에, Front는 다음 Front로 전진하면서 점차 해석 영역의 내부로 삼각형 요소를 채우게 된다. 이와 같은 방법에 의해서 해석영역의 경계에서는 비교적 이등변 삼각형에 가까운 삼각 요소가 생성된다.

• Journal of Navigation and Port Research
• /
• v.34 no.5
• /
• pp.367-373
• /
• 2010

When the numerical analysis is carried out, it is necessary to set proper elements as a feature of analysis domains for more accurate simulations. In this study, Distinct Element Method(DEM) is applied, only considering repulsive force and tensile force except for frictional force and resisting force of particle. When the filled particles with initial Quad-tree type is relocated by DEM, a blank space existing among the particles can be minimized because the shape of particle is circular. Finally, it is the effective feature that the centroidal disposion of the particles is similar to an equilateral triangle. Triangular mesh are formed by using the Delaunay triangular technique on these relocated particles, the quality of triangular mesh is more improved by carrying out Laplace interpolations. The compared result of Aspect Ratio before and after the Laplace interpolation is shown that although the quality of triangular mesh made by DEM is good, the later triangular mesh are higher quality than the formers. In this study, although the developed technique takes a longer calculational time than the previous technique to generate triangular mesh, it is considered that the applicable possibility is very high in the generation of finite element mesh about wave analysis and various numerical simulation to need a complex or reappearance of exact topography.

• Computational Structural Engineering
• /
• v.6 no.3
• /
• pp.99-112
• /
• 1993

One of the characteristics of Delaunay-Voronoii methods of mesh generation is local remeshing ability in comparison with other methods, which is very useful in adaptive finite element applications. Main part of the process is to construct remeshing element group out of the whole elements and to remesh it. Adjacent element array, accompanied with an additional algorithm of several lines, is introduced to make the process simple so that implementation of the concept is possible at the level of general PC users.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2021.07a
• /
• pp.605-607
• /
• 2021

본 논문에서는 지형 API를 활용해 사용자와 병원들의 위치를 들로네 삼각화로 그래프를 구성하고, 교통정보를 기반으로 사용자에게 최적의 경로를 알려주는 새로운 길 찾기 알고리즘을 제안한다. 경로를 분석하는 과정에서 교통정보를 활용하여 최단 시간이 걸리는 구간을 알려주어 전체적인 처리 시간을 최소화한다. 또한, 본 논문에서는 교통정보와 지형 API를 기반으로 들로네 삼각화를 구성하고, 구성된 간선을 기반으로 최적화 문제를 풀어냄으로써, 사용자에게 최적의 경로를 알려준다.

• Computational Structural Engineering
• /
• v.9 no.4
• /
• pp.141-154
• /
• 1996

Delaunay triangulation is a very powerful method of mesh generation for its versatility such as handling complex geometries, element density control, and local/global remeshing capability, The limit of generating simplex elements(3-node elements in 2-D) only is resolved by adding generation module of 6-node quadratic elements. Since proposed adjacency does not change from 3-node element mesh to 6-node mesh, generation module can utilize the original simplex element generator. Therefore, versatility of the Delaunay triangulation is preserved. A simple upsetting problem is employed to show the possibility of the algorithm.

• Journal of Aerospace System Engineering
• /
• v.18 no.3
• /
• pp.17-26
• /
• 2024

Aircraft engines are exposed to high temperatures, high pressures, and stress caused by the rotation of the turbine shaft during flight. These loads can result in microcracks both on the inside and outside surfaces of the structure. Consequently, this can lead to structural defects and negatively impact the lifespan of the parts. To proactively prevent these defects, a finite element analysis is carried out to identify cracks. However, this process is time-consuming and requires significant effort due to the repetitive nature of crack modeling. This study aims to develop a crack modeling method based on the finite element model. To achieve this, the Constrained Delaunay Triangulation (CDT) technique is employed to triangulate the space while considering limitations on point connections. The effectiveness of this method is validated by comparing stress intensity factors for semi-elliptical cracks in plates and cylindrical vessels. This approach proves to be a valuable tool for crack analysis studies.

• 한국전산유체공학회:학술대회논문집
• /
• 1999.11a
• /
• 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$.