• Korean Journal of Computational Design and Engineering
• /
• v.4 no.2
• /
• pp.79-86
• /
• 1999

A general approach to automatic generation of triangular meshes on three-dimensional surfaces is presented in this paper. The approach, developed with emphasis on program generality and interface with CAD/CAM systems, is based on the double mapping method and the looping method. The double mapping method is introduced and anew splitting scheme is proposed for the looping method employed for triangular mesh generation on the parametric domain. Several application examples are given.

• Korean Journal of Computational Design and Engineering
• /
• v.1 no.3
• /
• pp.224-233
• /
• 1996

An automatic mesh generation scheme with triangular finite elements on three-dimensional surfaces has been developed. The surface triangulation process is performed as follows. To begin, surfaces with key nodes are transformed to two-dimensional planes and the meshes with triangular elements are constructed in these planes. Finally, the constructed meshes are transformed back to the original 3D surfaces. For the mesh generation, an irregular mesh generation scheme is employed in which local mesh densities are assigned by the user along the boundaries of the analysis domain. For this purpose a looping algorithm combined with an advancing front technique using basic operators has been developed, in which the loops are recursively subdivided into subloops with the use of the best split lines and then the basic operators generate elements. Using the split lines, the original boundaries are split recursively until each loop contains a certain number of key nodes, and then using the basic operators such as type-1 and type-2, one or two triangular elements are generated at each operation. After the triangulation process has been completed for each meshing domain, the resulting meshes are finally improved by smoothing process. Sample meshes are presented to demonstrate the versatility of the algorithm.

• Journal of electromagnetic engineering and science
• /
• v.1 no.1
• /
• pp.78-82
• /
• 2001

For fast capacitance computation, a simple mesh refinement technique on MLFMA(Multi-Level Fast Multipole Algorithm) is proposed The triangular meshes are refined mainly in the area which has heavy charge density. The technique is applied to the capacitance extraction of three dimensional conductors. The results show good convergence with comparable accuracy. An adaptive technique concerned with MLFMA is useful to reduce computation time and the number of elements without additional computational efforts in large three dimensional problems.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.14 no.4
• /
• pp.249-255
• /
• 2014

We present a simple method to watermark three-dimensional (3D) triangular meshes that have been generated from the depth data of the Kinect sensor. In contrast to previous methods, which maintain the shape of 3D triangular meshes and decide the embedding place, requiring calculations of vertices and their neighbors, our method is based on selecting one of the coordinate axes. To maintain shape, we use discrete wavelet transform and constant regularization. We know that the watermarking system needs the information to be embedded; we used a text to provide that information. We used geometry attacks such as rotation, scales, and translation, to test the performance of this watermarking system. Performance parameters in this paper include the vertices error rate (VER) and bit error rate (BER). The results from the VER and BER indicate that using a correction term before the extraction process makes our system robust to geometry attacks.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.39 no.9
• /
• pp.921-927
• /
• 1990

This paper presents a mesh refinement scheme for 3-D adaptive finite element method. Firstly, the refinement of triangular meshes based on the bisection of triangles is discussed. And a new method to refine tetrahedral meshes employing the bisection method is presented. In two dimensional cases, it has been noted that all angles in the triangular meshes refined by the bisection method are greater than or equal to half the smallest angle in the original meshes. Through the examples where the newly proposed method is applied to three dimensional cases, it is shown that regarding the solid angles, the method gives nearly the same result as that in the two dimensional case. Accordingly, it can be concluded that the proposed method will be useful in the mesh refinements for 3-D adaptive finite element method.

• Korean Journal of Computational Design and Engineering
• /
• v.5 no.3
• /
• pp.207-214
• /
• 2000

For last 20 years, a number of researches and developments on finite element mesh generation has been carried out and most of them are comported of node generation part and node generation part. However these algorithms are inefficient in mesh veneration process and difficult to control the shape of elements when comparing with the generation of nodes and elements concurrently. In this study, therefore, an algorithm it proposed to generate nodes and elements concurrently for various two-dimensional objects having multiple holes. Inner node generation is performed by choosing three consecutive boundary nodes and comparing them with other close boundary nodes. As soon as inner nodes are determined, element generation is conducted based on the comparison of the distances among the generated inner nodes, three consecutive boundary nodes and other close boundary nodes. the generated element nodes become new boundary nodes for further repeated process. The processes are repeated through out each region until three consecutive boundary nodes finally form a tirangular element.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.14 no.1
• /
• pp.27-32
• /
• 2003

This paper describes to extend the fast algorithm fur the capacitance extraction of large three-dimensional object. The triangular meshes are used and refined adaptively in the area where the heavy charges reside in each iterative solving. This technique is applied to the capacitance extraction of a 68-pin cerquad package. The results show fast convergence, and this adaptive technique coupled with the fast algorithm is efficient to reduce the number of elements and computing time with least additional computational efforts in large three dimensional problems.

• Journal of KIISE
• /
• v.43 no.4
• /
• pp.419-429
• /
• 2016

Generating a 3D surface model from coronary artery segmentation helps to not only improve the rendering efficiency but also the diagnostic accuracy by providing physiological informations such as fractional flow reserve using computational fluid dynamics (CFD). This paper proposes a method to generate a triangular surface mesh using vessel structure information acquired with coronary artery segmentation. The marching cube algorithm is a typical method for generating a triangular surface mesh from a segmentation result as bit mask. But it is difficult for methods based on marching cube algorithm to express the lumen of thin, small and winding vessels because the algorithm only works in a three-dimensional (3D) discrete space. The proposed method generates a more accurate triangular surface mesh for each singular vessel using vessel centerlines, normal vectors and lumen diameters estimated during the process of coronary artery segmentation as the input. Then, the meshes that are overlapped due to branching are processed by mesh merging and merged into a coronary mesh.

• Journal of the Korean Society for Precision Engineering
• /
• v.13 no.10
• /
• pp.46-55
• /
• 1996

As industrial standard data, the STL format which approximates three dimensional CAD model to triangular facets, is used for RP(Rapid Prototyping) system in recent days. Because most RP system take the only form of two dimensional line segments as an input stream inspite of its imperfectness while converting into STL format, a CAD model is converted into a standard industrial format which is composed of many triangular facets. The error verifying process is composed of four main steps, and these are 1) Remove facets with two or more vertices equal to each other. 2) Fix overlapping error such as more than three facets adjacent to anedge. 3) Fill holes in the mesh by using Delaunay triangulation method. 4) Correct the wrong direction and normal vectors. This paper is concerned with serching the mentioned errors in advance and modifying them.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.13 no.1
• /
• pp.80-86
• /
• 2002

This paper describes to extend the MLFMA(Multi-Level Fast Multipole Algorithm) for three-dimensional capacitance computation in the case of conductors embedded in an arbitrary dielectric medium. The triangular meshes are used and refined in the area which has heavy charge density. This technique is applied to the capacitance extraction of three-dimensional structures with multiple dielectrics. The results show good convergence with the comparable accuracy, and this adaptive technique coupled with MLFMA is useful to reduce computing time and the number of elements with least additional computational efforts in large three dimensional problems.