• Journal of the Korea Computer Graphics Society
• /
• v.7 no.3
• /
• pp.9-18
• /
• 2001

Feature detection is important in various mesh processing techniques, such as mesh editing, mesh morphing, mesh compression, and mesh signal processing. In this paper, we propose a geometric snake as an interactive tool for feature detection on a 3D triangular mesh. A geometric snake is an extension of an image snake, which is an active contour model that slithers from its initial position specified by the user to a nearby feature while minimizing an energy functional. To constrain the movement of a geometric snake onto the surface of a mesh, we use the parameterization of the surrounding region of a geometric snake. Although the definition of a feature may vary among applications, we use the normal changes of faces to detect features on a mesh.

• Journal of Korea Multimedia Society
• /
• v.5 no.5
• /
• pp.552-561
• /
• 2002

In this paper, a new watermarking algorithm for STL files which contains 3D geometric information as triangular facets is proposed. STL files are widely used in rapid prototyping industry as a standard interchange format. The proposed algorithm inserts multi-bit watermark information into the surface normal vector and vertex description area of STL file without distorting the original 3D geometric information. According to the watermark bits, the position of normal vector and the direction of vertex sequence are modulated. The proposed algorithm is robust to the attack of changing the order of the triangular meshes. In addition, the invisibility requirement is also satisfied. Experiment results show that the proposed algorithm can encode and decode watermark bits into the various STL files without any distortion of 3D shape.

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

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.41 no.4
• /
• pp.123-130
• /
• 2018

Triangulation is one of the fundamental problems in computational geometry and computer graphics community, and it has huge application areas such as 3D printing, computer-aided engineering, surface reconstruction, surface visualization, and so on. The Delaunay refinement algorithm is a well-known method to generate quality triangular meshes when point cloud and/or constrained edges are given in two- or three-dimensional space. In this paper, we propose a simple but efficient algorithm to triangulate Voronoi surfaces of Voronoi diagram of spheres in 3-dimensional Euclidean space. The proposed algorithm is based on the Ruppert's Delaunay refinement algorithm, and we modified the algorithm to be applied to the triangulation of Voronoi surfaces in two ways. First, a new method to deciding the location of a newly added vertex on the surface in 3-dimensional space is proposed. Second, a new efficient but effective way of estimating approximation error between Voronoi surface and triangulation. Because the proposed algorithm generates a triangular mesh for Voronoi surfaces with guaranteed quality, users can control the level of quality of the resulting triangulation that their application problems require. We have implemented and tested the proposed algorithm for random non-intersecting spheres, and the experimental result shows the proposed algorithm produces quality triangulations on Voronoi surfaces satisfying the quality criterion.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2010.11a
• /
• pp.143-144
• /
• 2010

3차원 메쉬는 전송과 저장에 많은 저장 공간을 필요로 한다. 따라서 3차원 메쉬의 효과적인 전송 및 렌더링을 위해서는 3차원 객체에 대한 압축이 필수적이다. 이에 본 논문은 점진적 전송을 위한 기하 정보 압축 기법을 제안한다. 제안하는 알고리즘은 점진적 전송에서 각 레벨마다 추가되는 점의 기하 정보를 예측하는 효과적인 방법을 사용한다. 구체적으로 제안하는 기법은 상위 레벨의 점들을 이용하여 2차 곡면을 추정하고, 추정된 곡면을 통해 기하 정보를 예측 부호화한다. 실험 결과는 제안하는 알고리즘이 기하 정보 압축률을 향상시킬 수 있음을 보여준다.

• Transactions of Materials Processing
• /
• v.16 no.7
• /
• pp.538-548
• /
• 2007

In this paper, a novel approach which enables rapid die surface modification for sheet metal forming process is proposed. In this method an implicit surface which interpolates a given set of control points and displacement constraints is generated to compute the displacements at arbitrary points located on die surface. The proposed method does not depend on the underlying surface representation type and is affected neither by its complexity nor by its quality. In addition, the domain decomposition method is introduced in order to treat large surface model. The global domain of interest is divided into smaller domains where the problem can be solved locally. And then the local solutions are combined together to obtain a global solution. In order to verify the validity and effectiveness of the proposed method, various surface modifications are carried out fur three kinds of die surface model including polygonal surface composed of triangular and rectangular meshes, polynomial surface and NURBS surface.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.53 no.1
• /
• pp.38-42
• /
• 2004

In this paper we analyzed the electromagnetic behavior of a superconducting fault current limiter (SFCL) under the quench state using FEM. The analysis model used in this work is 5.5 KVA meander-line type SFCLs which are currently developed by Superconductor Power System Lab in Korea Electric Power Research Institute. Meshes of 3,650 triangular elements were used in the analysis of this SFCL. Analysis results showed that the distribution of current density was concentrated to inner curved line in meander-line type SFCL and the maximum current density was 14.61 A/$m^2$ and also the maximum Joule heat was 2,030 W/$m^2$ in this region. We think that the new and the modified structure must be considered for an uniform distribution of the electromagnetic field.

• 한국전산유체공학회:학술대회논문집
• /
• 1998.11a
• /
• pp.36-41
• /
• 1998

The cross-flow fan performance and its sound noise characteristics are predicted by computational methods. The unsteady incompressible Navier-Stokes equations in moving coordinates are solved by a SMAC method on unstructured triangular meshes, using a sliding mesh technique at the interface between the domain rotating with blades and the rest stationary part. The computationally predicted fan performance was favorably compared with experiment, and some numerical aspects of simulating the cross-flow fan are discussed. With the computed unsteady flow field, aeroacoustic sound noise of the fan is predicted by the Lighthill-Curie equation. The unsteady surface pressure fluctuations on stabilizer enables a prediction of BPF noise of the uniform pitch blade fan quite accurately. The aeroacoustic sound noise characteristics of both uniform and random pitch blade fans are also examined by SPL spectrum analysis.

• International Journal of CAD/CAM
• /
• v.6 no.1
• /
• pp.89-97
• /
• 2006

This paper presents a novel approach for non-iterative surface smoothing with feature preservation on arbitrary meshes. Laplacian operator is performed in a global way over the mesh. The surface smoothing is formulated as a quadratic optimization problem, which is easily solved by a sparse linear system. The cost function to be optimized penalizes deviations from the global Laplacian operator while maintaining the overall shape of the original mesh. The features of the original mesh can be preserved by adding feature constraints and barycenter constraints in the system. Our approach is simple and fast, and does not cause surface shrinkage and distortion. Many experimental results are presented to show the applicability and flexibility of the approach.

• Korean Journal of Computational Design and Engineering
• /
• v.13 no.6
• /
• pp.450-458
• /
• 2008

Recently, Cartesian grid approach has been popular to generate grid meshes for complex geometries in CFD (Computational Fluid Dynamics) because it is based on the non-body-fitted technique. This paper presents a method of an octree generation and boundary cell clipping using section curves for fast octree generation and elimination of redundant intersections between boundary cells and triangles from 3D triangular mesh. The proposed octree generation method uses 2D Scan-Converting line algorithm, and the clipping is done by parameterization of vertices from section curves. Experimental results provide octree generation time as well as Cut-cell clipping time of several models. The result shows that the proposed octree generation is fast and has linear relationship between grid generation time and the number of cut-cells.