• Title/Summary/Keyword: Delaunay 삼각화

Search Result 47, Processing Time 0.103 seconds

3D Mesh Creation using 2D Triangulation of 3D Point Clouds (2D 삼각화를 통한 3D 점집합으로부터의 메쉬 생성)

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

  • PDF

3D Mesh Creation using 2D Delaunay Triangulation of 3D Point Clouds (2차원 딜로니 삼각화를 이용한 3차원 메시 생성)

  • Choi, Ji-Hoon;Yoon, Jong-Hyun;Park, Jong-Seung
    • 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.

  • PDF

Adaptive Element-free Galerkin Procedures by Delaunay Triangulation (Delaunay 삼각화를 이용한 적응적 Element-free Galerkin 해석)

  • 이계희;정흥진;최창근
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.14 no.4
    • /
    • pp.525-535
    • /
    • 2001
  • In this paper, a new adaptive analysis scheme for element-free Galerkin method(EFGM) is proposed. The novel point of this scheme is that the triangular cell structure based on the Delaunay triangulation is used in the numerical integration and the node adding/removing process. In adaptive analysis with this scheme, there is no need to divide the integration cell and the memory cell structure. For the adaptive analysis of crack propagation, the reconstruction of cell structure by adding and removing the nodes on integration cells based the estimated error should be carried out at every iteration step by the Delaunay triangulation technique. This feature provides more convenient user interface that is closer to the real mesh-free nature of EFGM. The analysis error is obtained basically by calculating the difference between the values of the projected stresses and the original EFG stresses. To evaluate the performance of proposed adaptive procedure, the crack propagation behavior is investigated for several examples.

  • PDF

Modified Delaunay Triangulation Based on Data Structure of Geometric Modeller (형상 모델러의 자료구조에 의한 수정 Delaunay 삼각화)

  • Chae E.-M.;Sah J.-Y.
    • Journal of computational fluids engineering
    • /
    • v.2 no.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).

  • PDF

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

  • Sung, Young-Jin;Kim, Gyeong-Hwan
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.4
    • /
    • pp.547-559
    • /
    • 2010
  • Delaunay triangulation is suitable for fingerprint matching because of its robustness to rotation and translation. However, missing and spurious minutiae degrade the performance and computational efficiency. In this paper, we propose a method of combining local quality assessment and 4-category minutiae classification to improve accuracy and decrease computational complexity in matching process. Experimental results suggest that removing low quality areas from matching candidate areas and classifying minutiae improve computational efficiency without degrading performance. The results proved that the proposed algorithm outperforms the matching algorithm (BOZORTH3) provided by NIST.

Automatic Mesh Generation by Delaunay Triangulation and Its Application to Remeshing (Delaunay 삼각화기법을 이용한 유한요소망의 자동생성과 격자재구성에의 응용)

  • Jeong, Hyeon-Seok;Kim, Yong-Hwan
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.20 no.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.

Trimmed NURBS surface tessellation with sharp shape constraint (Sharp Shape를 유지하는 trimmed NURBS 곡면의 삼각화 방법)

  • Cho, Doo-Yeoun;Kim, In-Ill;Lee, Kyu-Yeul;Kim, Tae-Wan
    • Journal of Korea Game Society
    • /
    • v.2 no.1
    • /
    • pp.62-68
    • /
    • 2002
  • This paper presents a method for tessellating trimmed NURBS surface with preserving sharp shape Although several existing approaches need a large number of triangular meshes to represent sharp shape of surface, resulting triangular meshes may not reflect sharp edges properly. In this study, we flit detect the sharp shape of NURBS surface automatically using C1 continuous condition and then use constraint Delaunay triangulation method to present exact sharp shape with the minimum triangular meshes. And we also use approximated developed surface domain as triangulation domain of rimmed NURBS surface. In this way, the shape of triangular elements on the triangular domains is approximately preserved and can avoid distortion when mapped into three-dimensional space. finally, we show examples that demonstrate the effectiveness of the proposed scheme in terms of reducing the number of triangular meshes and preserving sharp shape of surface more exactly.

  • PDF

Delaunay Triangulation Construction Technique in Emergency Situations using Terrain API and Traffic Information (지형 API와 교통정보를 이용한 응급상황에서의 들로네 삼각화 구성 기법)

  • Shin, YoungChan;Kim, Donghui;Moon, Seong Hyeok;Kim, Jong-Hyun
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • /
    • pp.605-607
    • /
    • 2021
  • 본 논문에서는 지형 API를 활용해 사용자와 병원들의 위치를 들로네 삼각화로 그래프를 구성하고, 교통정보를 기반으로 사용자에게 최적의 경로를 알려주는 새로운 길 찾기 알고리즘을 제안한다. 경로를 분석하는 과정에서 교통정보를 활용하여 최단 시간이 걸리는 구간을 알려주어 전체적인 처리 시간을 최소화한다. 또한, 본 논문에서는 교통정보와 지형 API를 기반으로 들로네 삼각화를 구성하고, 구성된 간선을 기반으로 최적화 문제를 풀어냄으로써, 사용자에게 최적의 경로를 알려준다.

  • PDF

Development of Delaunay Triangulation Algorithm Using Subdivision (분할 Delaunay 삼각화 알고리즘 개발)

  • 박시형;이성수
    • Korean Journal of Computational Design and Engineering
    • /
    • v.7 no.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.

Development of Delaunay triangulation algorithm using quad subdivision (Quad-Subdivision을 이용한 Delaunay 삼각화 알고리즘 개발)

  • 박시형;이성수
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • /
    • 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.

  • PDF