• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1995.10a
• /
• pp.889-893
• /
• 1995

This paper verified error of STL file and presented a new application of reformed division method for reducing to appeared error by using Delaunay triangulation method that used to modify error of verified data. First, it is analyzed each vertices in hole error and classified follow case that is 1. case of plan or slope, 2. case of edge, 3. case of apex and 4. case of rapid curve, and reduced volume tolerance between original model and converted model after convert STL file.

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

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1894-1905
• /
• 1996

Delauuany triangulation which is the dual of Dirichlet tessellation is not affine invariant. In other words, the triangulation is dependent upon the choice of the coordinate axes used to represent the vertices. In the same reason, Delahanty tetrahedrization does not have an affine iveariant transformation property. In this paper, we present a new type of tetrahedrization of spacial points sets which is unaffected by translations, scalings, shearings and rotations. An affine invariant tetrahedrization is discussed as a means of affine invariant 2 -D triangulation extended to three-dimensional tetrahedrization. A new associate norm between two points in 3-D space is defined. The visualization of the structure of tetrahedrization can discriminate between Delaunay tetrahedrization and affine invariant tetrahedrization.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.2
• /
• pp.596-605
• /
• 1997

The synamic systrm emplohing the self-squared function, , $f(Z)=z^2+c$, provides the Mandelbrot set which classifies constants c using the divergence of the sequence starting from the origin.To speed-up the generation of Mandelbrot set images, two approaches , called as the divide-and-conquer technique and the triangular boundary tracing technique, have been developed.However , the divede-and-conquer technique genrates sequences of some pixels that so not affect graphical representations of the Mandelbrot set.The triangular boundary tracing tech-mique does noot represent some 8-connected components of the Mandelbrost set.In this paper, we prorose a new ;method which solves the 8-connectivity problem of triangular boundary tracing technique.This algorithm considers the divergence for only pixels which are essential to the graphical repressentation of the Mandelbrot set.It also foves good representations for 8-connected components like hairly structures.

• Journal of Korea Game Society
• /
• v.14 no.2
• /
• pp.55-66
• /
• 2014

Image warping is a technology to transform input images to be suitable for given conditions and has been recently utilized in changing face shape of characters in the field of movies or animation. Mesh warping which is one of warping methods that change shapes based on the features of face forms warping images by forming rectangular mesh groups around the eyes, nose, and mouth and matching them 1:1. This method has a problem in the resultant images are distorted in the segments of boundaries between meshes when there are errors in mesh control points or when meshes have been formed as many small area meshes. This study proposes a triangle based image interpolation technique to minimize the occurrence of errors in the process of forming natural warping images of face and process accurate results with a small amount of arithmetic operation and a short time. First, feature points that represent the face are found and these points are connected to form basic triangle meshes. The fact that the proposed method can reduce errors occurring in the process of warping while reducing the amount of arithmetic operation and time is shown through experiments.

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

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.9 no.3
• /
• pp.309-318
• /
• 1985

본 논문에서는 종형 구조물의 특미인 비대칭성을 고헌할 수 있고 굽힘에너지 (flexural energy)와 확장에너지(extension energy)를 모두 고헌하여 유한요소의 분할 이 용역한 사변형과 삼각형 판-셸 유한요소를 사용하였다.

• Journal of the Korea Computer Graphics Society
• /
• v.1 no.2
• /
• pp.234-240
• /
• 1995

광선추적법에서 계산시간의 대부분은 광선과 물체와의 교차 검사에 사용된다. 그러므로 빠른 교차검사는 광선추적 알고리즘의 속도 증가를 가져올 수 있다. 따라서 본 논문에서는 광선 추적 알고리즘을 이용하여 삼각형이나 사각형등의 물체로 구성된 이미지를 생성할 때 전처리과정(preprocessing)에서 미리 계산된 두 상수 vector $\hat{u}$과 $\hat{v}$을 이용하여 지금까지 알려진 방법보다 빠른 교차 검사를 수행함으로써 속도를 향상 시키는 방법을 제안한다. 또한 이 결과를 삼각형의 보간(interpolation)에서 뿐만 아니라, 적응분할(adaptive subdivision) 방법을 사용하는 래디오시티 모델(radiosity model)에서 자주 사용되는 일반 사각형에서의 효율적인 bilinear interpolation 기법을 제시한다.

• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.489-498
• /
• 2001

A new method for local control of arbitrary scattered data interpolation in the hyperbolic plane is developed in this paper. The issue associated with local control is very critical in the interactive in the interactive design field. Especially the suggested method in this paper could be effectively applied to the interactive shape modeling of genus-N objects, which are constructed on the hyperbolic plane. Since the effects of the changed data affects only the limited area around itself, it is more convenient for end-users to design a genus-N object interactively. Therefore, by improving the global interpolation on the hyperbolic plane where the genus-N object is constructed, this research is aiming at the development and implementation of the local interpolation on the hyperbolic plane. It is implemented using the following process. First, for localizing the interpolating functions, the hyperbolic domain is tessellated into arbitrary triangle patches and the group of adjacent triangle patches of each data point is defined as a sub-domain. On each sub-domain, a weight function is defined. Last, by blending of three weight functions on the overlapped triangles, local MQ interpolation is completed. Consequently, it is compared with the global MQ interpolation using several sample data and functions.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1997.10a
• /
• pp.651-654
• /
• 1997

Generally commercial FEA program needs computer circumstances such as specific operating system, hardware. But regardlessly to computer circumstances, program coded by JAVA can work only with webbrowser. 2 dimensional mesh generation and FE analysis using JAVA is presented in this paper.