• 한국전산유체공학회지
• /
• 제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).

• 산업경영시스템학회지
• /
• 제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.

• 대한의용생체공학회:학술대회논문집
• /
• 대한의용생체공학회 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.

• 대한의용생체공학회:의공학회지
• /
• 제21권3호
• /
• pp.225-231
• /
• 2000

표면에 의한 3차원 재구성 방법 중 Delaunay 삼각형 분할 방법은 기존의 기하학적 연결성 문제를 해결하고 영상의 질도 높은 것으로 평가받고 있다. 그러나 이 방법은 윤곽선의 위치에 따른 비 입체적 연결성 문제를 갖고 있다. 본 논문에서는 PC환경에서 이러한 문제를 개선한 Delaunay 삼각형 분할 재구성 방법을 제안하였다. 제안된 방법은 기존의 방법에서 나타나는 '비 입체(non-solid)‘ 사면체의 효과적인 처리를 위하여 수정된 External Voronoi Skeleton(EVS)을 이용한 제거 알고리즘을 사용하였다. 이를 적용한 결과. 원 객체 형태에 영향을 주지 않으면서 '비 입체' 사면체만이 제거됨을 확인할 수 있었다. 그리고 재구성된 영상의 표면이 사면체로 촘촘하게 연결되므로 복잡한 형태를 갖는 입체의 표면을 효과적으로 재구성할 수 있었다.

• Journal of Mechanical Science and Technology
• /
• 제18권12호
• /
• pp.2190-2203
• /
• 2004

A combined procedure for two-dimensional Delaunay mesh generation algorithm and an adaptive remeshing technique with higher-order compressible flow solver is presented. A pseudo-code procedure is described for the adaptive remeshing technique. The flux-difference splitting scheme with a modified multidimensional dissipation for high-speed compressible flow analysis on unstructured meshes is proposed. The scheme eliminates nonphysical flow solutions such as the spurious bump of the carbuncle phenomenon observed from the bow shock of the flow over a blunt body and the oscillation in the odd-even grid perturbation in a straight duct for the Quirk's odd-even decoupling test. The proposed scheme is further extended to achieve higher-order spatial and temporal solution accuracy. The performance of the combined procedure is evaluated on unstructured triangular meshes by solving several steady-state and transient high-speed compressible flow problems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권4호
• /
• pp.763-781
• /
• 2011

We present a texture-based hatching technique for color images and video. Whereas existing approaches produce monochrome hatching effects in considering of triangular mesh models by applying strokes of uniform size, our scheme produces color hatching effects from photographs and video using strokes with a range of sizes. We use a Delaunay triangulation to create a mesh of triangles with sizes that reflect the structure of an input image. At each vertex of this triangulation, the flow of the image is analyzed and a hatching texture is then created with the same alignment, based on real pencil strokes. This texture is given a modified version of a color sampled from the image, and then it is used to fill all the triangles adjoining the vertex. The three hatching textures that accumulate in each triangle are averaged and the result of this process across all the triangles forms the output image. We can also add a paper texture effect and enhance feature lines in the image. Our algorithm can also be applied to video. The results are visually pleasing hatching effects similar to those seen in color pencil drawings and oil paintings.

• 한국멀티미디어학회논문지
• /
• 제16권1호
• /
• pp.11-18
• /
• 2013

본 논문에서는 정확한 깊이를 추출하기 위해 고차 통계기반 초점 척도를 이용한 SFF(shape from focus) 알고리즘을 제시한다. 기존의 SFF기반 3차원 깊이 복원 기법들은 초점 척도로 SML(sum of modified Laplacian)을 사용하기 때문에, 성능이 영상의 특성에 크게 의존하여 초점이 정밀하거나 질감이 풍부한 영상에서만 효율적이다. 그러므로, 본 논문에서는 비교적 질감과 초점이 빈약한 영상에서도 초점 값을 추출할 수 있도록 고차 통계(HOS:higher order statistics)를 이용한 알고리즘을 제안한다. 이 초점 척도에 의해 초점 영역 맵이 생성되고 국부적으로 최적의 초점 값을 갖는 화소를 추출하기 위해 영역개선, 세선화, 모서리 검출과정이 순서적으로 적용된다. 최종적으로 추출된 점에 대해서 Delaunay 삼각화를 사용하여 3차원 모델정보를 생성한다.

• 한국정보과학회논문지:시스템및이론
• /
• 제32권10호
• /
• pp.520-529
• /
• 2005

본 논문에서는 특징 기반 3D 모델링 알고리즘을 제안한다. 깊이 기반 기술을 다루는 전통적인 방법들은 영상 정합을 위한 깊이정보추출에 많은 시간을 필요로 한다. 특징 기반 알고리즘에서 삼각형 내부의 모든 픽셀들에 대한 모델링 오차 계산이 필요하다 할지라도 깊이 기반 보다는 특징기반 방법들이 보다 적은 계산 부담을 가지나 이는 또한 계산 시간을 증가 시킨다. 그러므로 제안된 알고리즘은 효율적인 3D 모델을 생성하기 위해 초기 3D 모델 생성, 모델 평가 및 모델 세분화의 3단계로 구성하였다. 초기 모델 생성을 위해 자기 변화와 델루니 삼각화가 사용되었고 이 단계에서 빠른 경계 추출과 점진적인 델루니 삼각화 및 삼각형 내부의 중심에 가까운 정점을 선택하거나 모든 픽셀에 대한 오차 계산을 위한 연산 시간을 줄이기 위해 형태학적 미분 연산자를 수정하여 이용하였다. 모델 생성 후 평가 단계에서 표면의 변이 변화와 근사 오차 및 표면의 크기를 평가하여 드물게 정합을 수행 하였고, 그 후 큰 오차를 갖는 표면들을 선택하여 작은 표면이 되게 세밀화 작업을 했다. 실험 결과 제안된 알고리즘이 평탄영역 및 급격한 영역에서 보다 적은 모델링 오류로 적응적인 모델을 획득할 수 있었고 모델 획득시간을 현저하게 줄일 수 있었다.

• 한국CDE학회논문집
• /
• 제12권4호
• /
• pp.255-262
• /
• 2007

In the finite element analysis of forming process, objects are described with a finite number of elements and nodes and the approximated solutions can be obtained by the variational principle. One of the shortcomings of a finite element analysis is that the structure of mesh has become inefficient and unusable because discretization error increases as deformation proceeds due to severe distortion of elements. If the state of current mesh satisfies a certain remeshing criterion, analysis is stopped instantly and resumed with a reconstructed mesh. In the study, a new remeshing algorithm using tetrahedral elements has been developed, which is adapted to the desired mesh density. In order to reduce the discretization error, desired mesh sizes in each lesion of the workpiece are calculated using the Zinkiewicz and Zhu's a-posteriori error estimation scheme. The pre-constructed mesh is constructed based on the modified point insertion technique which is adapted to the density function. The object domain is divided into uniformly-sized sub-domains and the numbers of nodes in each sub-domain are redistributed, respectively. After finishing the redistribution process of nodes, a tetrahedral mesh is reconstructed with the redistributed nodes, which is adapted to the density map and resulting in good mesh quality. A goodness and adaptability of the constructed mesh is verified with a testing measure. The proposed remeshing technique is applied to the finite element analyses of forging processes.