• 산업경영시스템학회지
• /
• 제41권4호
• /
• pp.123-130
• /
• 2018

Triangulation is one of the fundamental problems in computational geometry and computer graphics community, and it has huge application areas such as 3D printing, computer-aided engineering, surface reconstruction, surface visualization, and so on. The Delaunay refinement algorithm is a well-known method to generate quality triangular meshes when point cloud and/or constrained edges are given in two- or three-dimensional space. In this paper, we propose a simple but efficient algorithm to triangulate Voronoi surfaces of Voronoi diagram of spheres in 3-dimensional Euclidean space. The proposed algorithm is based on the Ruppert's Delaunay refinement algorithm, and we modified the algorithm to be applied to the triangulation of Voronoi surfaces in two ways. First, a new method to deciding the location of a newly added vertex on the surface in 3-dimensional space is proposed. Second, a new efficient but effective way of estimating approximation error between Voronoi surface and triangulation. Because the proposed algorithm generates a triangular mesh for Voronoi surfaces with guaranteed quality, users can control the level of quality of the resulting triangulation that their application problems require. We have implemented and tested the proposed algorithm for random non-intersecting spheres, and the experimental result shows the proposed algorithm produces quality triangulations on Voronoi surfaces satisfying the quality criterion.

• 한국수학교육학회지시리즈E:수학교육논문집
• /
• 제31권3호
• /
• pp.257-277
• /
• 2017

본 연구의 주된 목적은 크게 두 가지로 나눌 수 있다. 첫째, 최근 수학적 모델링이 강조되는 상황에서 보로노이 다이어그램과 들로네 삼각분할을 주제로 영재교육을 위한 수학적 모델링 프로그램을 개발하는 것이다. 둘째, 본 연구에서 개발한 수학적 모델링 프로그램을 실제 영재교육 수업에 적용한 결과를 분석하여 수학적 모델링 수업을 설계하는 현직교사와 융합형 영재프로그램을 개발하는 영재교사에게 도움을 주고자 한다.

• 한국CDE학회논문집
• /
• 제12권6호
• /
• pp.422-428
• /
• 2007

Presented in the paper is a procedure to reconstruct a triangular mesh from a point cloud. Although, the proposed procedure is based on the well-known Voronoi diagram approach, it introduces a selection method of 'Pole' to improve the quality of resulting mesh. To select the appropriate Poles for high quality of Triangular mesh, the patterns that the Poles affect to the mesh quality are carefully analyzed. It is possible to improve the mesh quality by controlling the selection method of 'Pole' in terms of distance limit. The initial mesh obtained by the proposed procedure may include invalid triangles. To relieve this problem, a slicing method is proposed to remove invalid triangles from the initial mesh. At last, correcting technique of normal vectors of generated mesh is introduced.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 신호처리소사이어티 추계학술대회 논문집
• /
• pp.297-300
• /
• 2003

In this paper, fingerprint minutiae mosaicking algorithm using minutiae of fingerprint is proposed. First, minutiae map is generated from minutiae of fingerprint and minutiae constellation is generated from fingerprint minutiae map. Minutiae constellation is constellation-shaped structure generated from Voronoi Diagram and Delaunay Triangulation using information of minutiae. Secondly, common region is detected by similarity of minutiae constellation of fingerprint minutiae map and minutiae map of individual fingerprint image is composed. Consequently composite minutiae map by mosaicking of fingerprint minutiae improve the performance of the fingerprint matching system.

• 한국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.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2003년도 추계학술대회
• /
• pp.1274-1279
• /
• 2003

In this paper, a new meshfree technique which improves the numerical integration accuracy is introduced. This new method called the Petrov-Galerkin natural element(PG-NE) is based on the Voronoi diagram and the Delaunay triangulation which is based on the same concept used for conventional natural element method called the Bubnov-Galerkin natural element(BG-NE). But, unlike BG-NE method, the test shape function is differently chosen from the trial shape function. The proposed technique ensures that the numerical integration error is remarkably reduced.

• 한국전산구조공학회논문집
• /
• 제18권2호
• /
• pp.103-111
• /
• 2005

본 논문에서는 수치적분 정도를 향상시킬 수 있는 새로운 무요소 기법을 제안한파 저자들에 의해 페트로프-갤러킨 자연요소법(PG-NEM)이라 명명된 이 새로운 기법은 보로노이 다이어그램과 델라우니 삼각화에 기반을 두고 있으며, 이는 BG-NEM이라 불리는 기존의 자연요소법과 개념적으로 동일하다. 하지만, 동일한 시험 형상함수와 시도 형상함수를 선택하는 BG-NEM과는 달리, PG-NEM에서는 지지영역이 적분을 위한 배경격자에 정확하게 일치하도록 시험 형상함수를 독립적으로 선택하는 페트로프-갤러킨 개념에 기반을 두고 있다. 따라서, 제안된 기법은 BG-NEM과 비교하여 수치적분 정도를 현저히 향상시킬 것으로 기대된다.

• 대한전기학회논문지
• /
• 제37권12호
• /
• pp.847-853
• /
• 1988

A method of three-demensional finite element mesh generation is presented in this paper. This method is based on the Delaunay's triangulation whose dual is Voronoi's diagram. A set of points is given on the boundary surface of the concerning domain and the initial tetrahedra are generated by the given set of points. Then, the quality of every tetrahedron is investigated and the interior points are generated near the tetrahedra which are inferior in quality and the tetrahedra of good quality can be controlled by the density of the initial boundary points. Regions with different material constant can be refined in tetrahedra respectively. To confirm the effectiveness of this algorithm,the total volume of tetrahedra was compared to the true volume and this mesh generator was applied to a three-dimensional electostatic problem.

• 한국멀티미디어학회논문지
• /
• 제9권10호
• /
• pp.1282-1295
• /
• 2006

본 논문은 원 영상의 세부 묘사 유지를 위한 이미지 타일 모자이크 방법을 제안한다. 이 방법은 기존의 모자이크 방법들이 빈 공간 발생으로 인해 세부 묘사 표현의 어려움을 지니고 있는 점을 개선하였다. 이는 타일 내부의 세부 묘사를 위한 이미지 타일의 사용과 타일간의 빈 공간을 제거하기 위한 두 층의 타일 사용을 통해 구현된다. 본 논문에서 제시한 방법은 다음 세 단계로 구성된다. 첫째, 에지 회피 기법이 적용된 무게 중심 보로노이 다이어그램(CVD: Centroidal Voronoi Diagram)을 통해 위층 타일의 위치를 얻고, 딜로니 삼각형화(Delaunay Triangulation)를 이용해 아래층 타일의 위치를 계산한다. 둘째, 타일간의 관계와 에지를 고려해 타일의 크기와 방향 등의 속성을 설정한다. 셋째, 이미지 타일의 적용을 위해 포토 모자이크 기법을 사용한다. 이때, 다단계 인덱싱 기법을 통해 이미지 검객의 속도를 높인다. 위의 과정을 통해 기존의 방법들에 비해 타일 간의 빈공간이 최소화되고 타일 내부의 세부 묘사가 강화된 모자이크 영상을 얻는다.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2004년도 봄 학술발표회 논문집
• /
• pp.333-340
• /
• 2004

This paper deals with geometric nonlinear analyses using a new meshfree technique which improves the numerical integration accuracy. The new method called the Petrov-Galerkin natural element method (PGNEM) is based on the Voronoi diagram and the Delaunay triangulation which is based on the same concept used for conventional natural element method called the Bubnov-Galerkin natural element method (BGNEM). But, unlike BGNEM, the test shape function is differently chosen from the trial shape function. In the linear static analysis, it is ensured that the numerical integration error of the PGNEM is remarkably reduced. In this paper, the PGNEM is applied to large deformation problems, and the accuracy of the proposed numerical technique is verified through the several examples.