• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.37 no.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.

• Proceedings of the KOSOMBE Conference
• /
• v.1998 no.11
• /
• 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.

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

The objective of this research is to develop an efficient reverse engineering method of 3-dimensional compound surfaces for raped prototyping process. As a first step, several image processing techniques were applied to the measured data obtained using laser scanner. And the boundary information of the compound surface were extracted to divide the surface into several separate regions. As a next step, the Delaunay triangulation method were applied to reconstruct the surface based on the measured data and the boundary information. Finally, the STL file were created for the rapid prototyping process. Required simulations and experiments were performed and the results were analyzed to show the effectiveness of the proposed methods.

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

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.41 no.6
• /
• pp.1-10
• /
• 2004

A haptic rendering system is proposed for a puncture task of a virtual vertebra model. To build a mesh model from medical images, Delaunay triangulation is applied and physical models are based on elasticity theory. Also, a redundant actuated 6 DOF parallel type haptic device is designed to display large force and to resolve the singularity problem of parallel type mechanisms. Haptic feeling of puncture task and the performance of the proposed haptic device are tested by two puncture task experiments.

• Korean Journal of Computational Design and Engineering
• /
• v.14 no.4
• /
• pp.217-224
• /
• 2009

Most divide-and-conquer implementations for Delaunay triangulation utilize quad-edge or winged-edge data structure since triangles are frequently deleted and created during the merge process. How-ever, the proposed divide-and-conquer algorithm utilizes the array based data structure that is much simpler than the quad-edge data structure and requires less memory allocation. The proposed algorithm has two important features. Firstly, the information of space partitioning is represented as a permutation vector sequence in a vertices array, thus no additional data is required for the space partitioning. The permutation vector represents adaptively divided regions in two dimensions. The two-dimensional partitioning of the space is more efficient than one-dimensional partitioning in the merge process. Secondly, there is no deletion of edge in merge process and thus no bookkeeping of complex intermediate state for topology change is necessary. The algorithm is described in a compact manner with the proposed data structures and operators so that it can be easily implemented with computational efficiency.

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

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10b
• /
• pp.202-205
• /
• 2007

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

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

• Journal of the Korean Society for Precision Engineering
• /
• v.12 no.2
• /
• pp.162-172
• /
• 1995

In this paper new mesh generation method is proposed for crack propagation analysis based on the finite element method. The main tool of the method is the Delaunay Triangulation, Transfinete element mapping, and it allows the setting of the arbitrary crack-growth increment and the arbitrary crack direction. It has the form of a subroutine, and it is easily introduced as a subroutine for any mesh generation method which is based on the blocking method.