• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.3 s.96
• /
• pp.53-61
• /
• 1999

STL has several errors such as orientation error, hole error, and acute triangle error on being translated from CAD software. These errors should be corrected before using in Rapid Prototyping. So the software is necessary to correct errors. In this study, STL Editor which is a system for STL error correction and shape modification is developed and contains following characteristics. 1.Apply the triangle based data st겨cture. 2.Use the graphic user interface for easy work. 3.Use the Diet method to reduce data size. 4.Use the Delaunay triangulation method to enhance the quality of STL. 5.Modify the STL errors manually.

• Journal of the Korean Data and Information Science Society
• /
• v.28 no.3
• /
• pp.505-513
• /
• 2017

Recently, numerous small area estimation studies have been conducted to obtain more detailed and accurate estimation results. Most of these studies have employed spatial regression models, which require a clear definition of spatial neighborhoods. In this study, we introduce the Delaunay triangulation as a method to define spatial neighborhood, and compare this method with the k-nearest neighbor method. A simulation was conducted to determine which of the two methods is more efficient in defining spatial neighborhood, and we demonstrate the performance of the proposed method using a land price data.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.32 no.9
• /
• pp.41-48
• /
• 2004

In this work, a domain-wise hash structure is developed for efficient data handling, and by using the developed domain-wise hash structure, an automatic triangular mesh generation algorithm is proposed. To generate the optimal nodal points and triangles efficiently, the advancing layer method and Delaunay triangulation method are utilized. To investigate the performance of the proposed algorithm, benchmarking tests are carried out for various models including convex, concave and complicated shapes through the developed object oriented C++ mesh generation code.

• Journal of Korea Multimedia Society
• /
• v.13 no.6
• /
• pp.825-832
• /
• 2010

This paper presents only a matching algorithm based on Delaunay triangulation and Parametrization from the extracted minutiae points. This method maps local neighborhood of points of two different point sets to unit-circle using topology information by Delaunay triangulation method from feature points of real fingerprint. Then, a linked convex polygon that includes an interior point is constructed as one-ring which is mapped to unit-circle using Parametrization that keep shape preserve. In local matching, each area of polygon in unit-circle is compared. If the difference of two areas are within tolerance, two polygons are consider to be matched and then translation, rotation and scaling factors for global matching are calculated.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2017.11a
• /
• pp.218-220
• /
• 2017

Recently, stitching techniques are used for obtaining wide FOV, e.g., panorama contents, from normal cameras. Despite many proposed algorithms, the no objective quality evaluation method is developed, so the comparison of algorithms are performed only in subjective way. The paper proposes a 'Delaunay-triangulation based objective assessment method' for evaluating the geometric and photometric distortions of stitched or warped images. The reference and target images are segmented by Delaunay-triangulation based on matched points between two images, the average Euclidian distance is used for geometric distortion measure, and the average or histogram of PSNR for photometric measure. We shows preliminary results with several test images and stitching methods for demonstrate the benefits and application.

• Proceedings of the KSME Conference
• /
• 2003.11a
• /
• 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.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.3
• /
• pp.155-160
• /
• 2001

본 논문은 영역별 근접 그래프 (geographic nearest neighbor graph)와 레인지 트리 (range tree)를 이용하여 평면 위의 n 개의 점에 대한 L$_{\infty}$ (L$_1$) 거리 (metric) 상의 디루니 삼각분할 (Delaunay triangulation)을 구축하는 방법을 소개한다. 이 방법은 L$_{\infty}$ (L$_1$) 거리 상에서 디루니 삼각분할에 있는 각 삼각형의 최소한 한 선분이 영역별 근접 그래프에 포함됨을 이용하여 레인지 트리 방법으로 디루니 삼각분할을 구축한다. 본 방법은 0(nlogn)의 순차계산 시간에 L$_{\infty}$ (L$_1$) 디루니 삼각분할을 구축하며, CREW-PRAM (Concurrent Read Exclusive Write Parallel Random Access Machine)에서 0(n)의 프로세서로 0(logn)의 병렬처리 시간에 L$_{\infty}$ (L$_1$) 디루니 삼각분할을 구축한다. 또한, 이 방법은 직선간의 교차점 계산 대신 거리비교를 하기 때문에 수치오차가 적고 구현이 용이하다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10a
• /
• pp.545-547
• /
• 2000

본 논문은 영역별 근접 그래프(geographic nearest neighbor graph)와 레인지 트리(range tree)를 이용하여 평면 위의 n 개의 점에 대한 L$\infty$(L1) 거리(metric) 상의 디루니 삼각분할(Delaunay triangulation)을 구축하는 방법을 소개한다. 이 방법은 L$\infty$(L1) 거리상에서 디루니 삼각분할에 있는 각 삼각형의 최소한 한 선분이 영역별 근접 그래프에 포함됨을 이용하여 레인지 트리 방법으로 디루니 삼각분할을 구축한다. 본 방법은 O(nlogn)의 순차계산 시간에 L$\infty$(L1) 디루니 삼각분할을 구축하며, CREW-PRAM (Concurrent Read Exclusive Write Programmable Random Access Machine)에서 O(n)의 프로세서로 O(logn)의 병렬처리 시간에 L$\infty$(L1) 디루니 삼각분할을 구축한다. 또한, 이 방법은 직선간의 교차점 계산 대신 거리비교를 하기 때문에 수치오차가 적고 구현이 용이하다.

• Journal of the Korean Society for Precision Engineering
• /
• v.17 no.7
• /
• pp.74-79
• /
• 2000

Integrating a 3D solid modeler with a general purpose FEM code, an automatic nonlinear analysis system of the 3D crack problems has been developed. A geometry model, i.e. a solid containing one or several 3D cracks is defined. Several distributions of local node density are chosen, and then automatically superposed on one another over the geometry model by using the fuzzy knowledge processing. Nodes are generated by the bucketing method, and ten-noded quadratic tetrahedral solid elements are generated by the Delaunay triangulation techniques. The complete finite element(FE) model generated, and a stress analysis is performed. In this system, burden to analysts fur introducing 3D cracks to the FE model as well as fur estimating their fracture mechanics parameters can be dramatically reduced. This paper describes the methodologies to realize such functions, and demonstrates the validity of the present system.

• Journal of the Korean Society for Precision Engineering
• /
• v.24 no.5
• /
• pp.127-134
• /
• 2007

Presented in the paper is an algorithm to generate a section curve by slicing a point cloud including tens of thousands of points. Although, there have been previous research results on the slicing problem, they are quite sensitive on the density variations of the point cloud, as well as on the local noise in the point cloud. To relive the difficulties, three technological requirements are identified; 1) dominant point sampling, 2) avoiding local vibration, and 3) robustness on the density changes. To satisfy these requirements, we propose a new slicing algorithm which is based on a node-sphere diagram. The algorithm has been implemented and tested with various examples.