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

• 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).

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2000.10a
• /
• 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.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.8 no.3
• /
• pp.35-41
• /
• 1999

STL which is used in Rapid Prototyping is composed of a lot of triangular facets. The number of triangles and the shapes of these triangles determine the quality of STL. Therefore, proper algorithm is necessary to enhance the quality of triangular patch. In this paper we used the Delaunay triangulation method to apply to following processes. 1) On processing for reducing sharp triangles which cause errors on intersection. 2) On processing for connecting two or more collinear edges. 3) On processing for deleting unnecessarily inserted points in coplanar polygon.

• 한국전산유체공학회:학술대회논문집
• /
• 2011.05a
• /
• pp.194-198
• /
• 2011

In this study, an efficient algorithm for Delaunay triangulation of a number of points which can be used on a GPU-based parallel computation is studied The developed algorithm is programmed using CUDA library. and the program takes full advantage of parallel computation which are concurrently performed on each of the threads on GPU. The results of partitioned triangulation collected from the GPU computation requires proper stitching between neighboring partitions and calculation of connectivities among triangular cells on CPU In this study, the effect of number of threads on the efficiency and total duration for Delaunay grid generation is studied. And it is also shown that GPU computing using CUDA for Delaunay grid generation is feasible and it saves total time required for the triangulation of the large number points compared to the sequential CPU-based triangulation programs.

• Korean Journal of Computational Design and Engineering
• /
• v.22 no.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.

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

• Journal of Information Processing Systems
• /
• v.14 no.2
• /
• pp.435-447
• /
• 2018

Fingerprint-based biometric identification is one of the most interesting automatic systems for identifying individuals. Owing to the poor sensing environment and poor quality of skin, biometrics remains a challenging problem. The main contribution of this paper is to propose a new approach to recognizing a person's fingerprint using the fingerprint's local characteristics. The proposed approach introduces the barycenter notion applied to triangles formed by the Delaunay triangulation once the extraction of minutiae is achieved. This ensures the exact location of similar triangles generated by the Delaunay triangulation in the recognition process. The results of an experiment conducted on a challenging public database (i.e., FVC2004) show significant improvement with regard to fingerprint identification compared to simple Delaunay triangulation, and the obtained results are very encouraging.

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

• Korean Journal of Computational Design and Engineering
• /
• v.10 no.3
• /
• pp.168-178
• /
• 2005

The Delaunay triangular net is primarily characterized by a balance of the whole by improving divided triangular patches into a regular triangle, which closely resembles an equiangular triangle. A triangular net occurring in certain, point-clustered, data is unique and can always create the same triangular net. Due to such unique characteristics, Delaunay triangulation is used in various fields., such as shape reconstruction, solid modeling and volume rendering. There are many algorithms available for Delaunay triangulation but, efficient sequential algorithms are rare. When these grids involve a set of points whose distribution are not well proportioned, the execution speed becomes slower than in a well-proportioned grid. In order to make up for this weakness, the ids are divided into sub-grids when the sets are integrated inside the grid. A method for finding a mate in an incremental construction algorithm is to first search the area with a higher possibility of forming a regular triangular net, while the existing method is to find a set of points inside the grid that includes the circumscribed sphere, increasing the radius of the circumscribed sphere to a certain extent. Therefore, due to its more efficient searching performance, it takes a shorer time to form a triangular net than general incremental algorithms.