• Korean Journal of Computational Design and Engineering
• /
• v.5 no.2
• /
• pp.144-154
• /
• 2000

We propose an algorithm for obtaining a triangular approximation of a trimmed NLRBS surface. Triangular approximation is used in the pre-processing step of many applications such as RP(Rapid Prototyping), NC(Numerical Control) and FEA(Finite Element Analysis), etc. The algorithm minimizes the number of triangular elements within tolerance and generates a valid triangular mesh for STL file and NC tool path generation. In the algorithm, a subdivision method is used. Since a patch is a basic element of triangular mesh creation, boundary curves of a patch are divided into line segments and the division of curves is applied for the interior of the surface. That is, boundary curves are subdivided into line segments and two end points of each line segment are propagated to the interior of the surface. For the case of a trimmed surface, triangulation is carried out using a model space information. The algorithm is superior because the number of elements can be controlled as the curvature of the surface varies and it generates the triangular mesh in a trimmed region efficiently. To verify the efficiency, the algorithm was implemented and tested for several 3D objects bounded by NURBS surfaces.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.1
• /
• pp.11-18
• /
• 2001

In this paper, we proposed the image compression algorithm using triangular feature based GHA. In feature extraction, the input images are divided into eight areas of triangular shape, that has positional information for face image compression. The proposed algorithm reduces blocking effects in image reconstruction and contains informations of face feature and shapes of face as input images are divided into eight. We used triangular feature extraction for positional information and GHA for shape information of face images. Simulation results show that the proposed algorithm has a better performance than the block based K-means and non-parsed image based GHA in PSNR at the same bpp.

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

• Journal of Digital Contents Society
• /
• v.16 no.3
• /
• pp.373-379
• /
• 2015

In this paper, we propose an online VQ Codebook generation method for updating an existing VQ Codebook in real-time and adding to an existing cluster with newly created text data which are news paper, web pages, blogs, tweets and IoT data like sensor, machine. Without degrading the performance of the batch VQ Codebook to the existing data, it was able to take advantage of the newly added data by using a triangle inequality which modifying the VQ Codebook progressively show a high degree of accuracy and speed. The result of applying to test data showed that the performance is similar to the batch method.

• Proceedings of the KIEE Conference
• /
• 2003.07c
• /
• pp.1454-1456
• /
• 2003

전기절연재로서의 성능이 우수하며, 다른 물질과의 결합 및 성형의 편리성 및 경량화에 부합할 수 있는 실리콘 고무의 사용이 급증하고 있다. 이에 본 논문에서는 현수애자에 사용중인 실리콘 고무를 선택하여 제조시에 발생할 수 있는 내부보이드에 대한 전기적특성을 알아보기 위해 실리콘 고무를 3층으로 적층하여 중간층 중심에 비슷한 체적으로 인공보이드를 원통 및 삼각기등형의 보이드를 제작하여 보이드형상 변화에 따른 부분방전전하량을 측정하였다. 위상(${\Phi}$)-전하량(q)-빈도(n)에 대한 데이터를 3차원그래프로 나타냈으며, 또한 평균방전전류 및 방전전력 변화를 통한 보이드 결함 특성을 파악하였다. 그 결과, 전압인가 시간에 따라 원통보이드의 경우 초기에는 방전전류 및 방전전력이 증가 하다가 일정시간이 경과하면 감소하는 형태를 나타냈으며, 삼각기둥보이드의 경우 계속적으로 증가하는 모습을 보여주었다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.8
• /
• pp.3295-3300
• /
• 2012

Three Dimensional finite element method (FEM) was used to obtain the stress intensity factor for subsurface cracks and surface cracks existing in inhomogeneous materials. A geometry model, i.e. a solid containing one or several 3D cracks is defined. Several distributions of local node density are chosen, and then automatically superposed on one another over the geometry model. Nodes are generated by the bubble packing, and ten-noded quadratic tetrahedral solid elements are generated by the Delaunay triangulation techniques. To examine accuracy and efficiency of the present system, the stress intensity factor for a semi-elliptical surface crack in a plate subjected to uniform tension is calculated, and compared with Raju-Newman's solutions. Then the system is applied to analyze interaction effects of two dissimilar semi-elliptical cracks in a plate subjected to uniform tension.

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

• Journal of the Korean Association of Geographic Information Studies
• /
• v.10 no.3
• /
• pp.113-122
• /
• 2007

The rapid growth of aerial survey and remote sensing technology has enabled the rapid acquisition of very large amounts of geographic data, which should be analyzed using real-time visualization technology. The level of detail(LOD) algorithm is one of the most important elements for realizing real-time visualization. We chose the triangulated irregular network (TIN) method to generate normalized digital elevation model(DEM) data. First, we generated TIN data using contour lines obtained from a two-dimensional(2D) digital map and created a 2D grid array fitting the size of the area. Then, we generated normalized DEM data by calculating the intersection points between the TIN data and the points on the 2D grid array. We used constrained Delaunay triangulation(CDT) and ray-triangle intersection algorithms to calculate the intersection points between the TIN data and the points on the 2D grid array in each step. In addition, we simulated a three-dimensional(3D) terrain model based on normalized DEM data with real-time visualization using a Microsoft Visual C++ 6.0 program in the DirectX API library and a quad-tree LOD algorithm.

• Korean Journal of Plant Taxonomy
• /
• v.49 no.2
• /
• pp.140-144
• /
• 2019

A new taxon, Viola ramiflora K. O. Yoo (Violaceae), from Jeju-do is described and illustrated. V. ramiflora shares several characteristics (pale purple flowers; triangular-ovate, ovate, or oblong leaf blades; winged petioles) with the related species V. hirtipes, V. japonica, V. phalacrocarpa, and V. seoulensis. However, this new species has branched cleistogamous and chasmogamous peduncles and oblong-ovate cleistogamous bracteoles.

• The Sea:JOURNAL OF THE KOREAN SOCIETY OF OCEANOGRAPHY
• /
• v.8 no.3
• /
• pp.340-348
• /
• 2003

Sedimentological investigations on surface and suspended sediments were performed in Kwangyang Bay of the middle South Sea in order to reveal recent changes in depositional environments concerning anthropogenic influence. A variety of coastal developments caused the texture of the surface sediments to become distinctively finer, particularly in the southwestern part of the bay. Accordingly, the westward lining sedimentary facies was somewhat simplified from triple-mode distribution to the dual-mode one by the construction of POSCO. This east-west distribution to the sedimentary facies has recently graded into the north-south distribution by further construction of other industrial complexes including Kwangyang Port. The prominent textural changes in surface sediments are most likely associated with weakening of tidal currents related to the developments which is anticipated to be .still continued. The distribution and flux estimation of suspended sediments suggest a noticeable import of fine particles into the bay predominantly through a northern entrance rather than the southern entrance. The movements of suspended sediments in the water level near the seabed prevailed over those of the mid and surficial levels.