• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.4
• /
• pp.671-684
• /
• 2001

Several design problems of composite structures are studied via a global optimizer based on attraction regions. MSC/NASTRAN is adopted for static and eigenvalue analysis. The method of modified feasible direction in DOT is used for local optimization. Through the review of global optimization algorithms, the triangular patch algorithm is selected because the algorithm is known to be efficient, robust and powerful for general nonlinear optimization problems. For general applicability, various mechanical properties are considered as design objectives; strain energy, eigenvalue, weight, displacement, and buckling load. In all cases considered, the triangular patch algorithm results in a lot of optimum points and useful design patterns, that are not easy by local algorithms or conventional global algorithms can be determined.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.1 s.173
• /
• pp.240-249
• /
• 2000

An improved global optimization algorithm is developed by extending the domain elimination method. The concept of triangular patch consists of two or more trajectories of local minimizations is introduced to widen the attraction region of the domain elimination method. Using the an-]c between each of three vertices of the patch and a design point, we measure the proximity, between the design point and the patch. With the Gram-Schimidt orthonormalization, this method can be extended to general n-dimensional problems. We code the original domain elimination algorithm and a patch-based algorithm. Then we compare the performance of two algorithms. Through the well-known example problems. the algorithm using patch is shown to be superior to the original domain elimination algorithm in view of computational efficiency.

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

• Transactions of Materials Processing
• /
• v.6 no.5
• /
• pp.416-424
• /
• 1997

In the present study, a contact search and check algorithm for general tool surface described by triangular FE patch is proposed. To improve numerical stability, SEAM element using the linear Coons interpolation has been used. To check the proposed algorithm, both clover cup and L-shape cup deep drawing processes are calculated. The computed results shows that the proposed contact algorithm can be successfully applied for sheet metal forming processes with general shaped tools.

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

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.2
• /
• pp.22-29
• /
• 2002

This paper presents an algorithm for segmentation of 3D triangular mesh data. The proposed algorithm uses iterative merging of adjacent triangle pairs based on the orientation of triangles. The surface is segmented into patches, where each patch has a similar normal property Thus, each region can be approximated to planar patch and its boundaries have perceptually important geometric information of the entire mesh model. The experimental results show that the Proposed algorithm is peformed efficiently.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.773-776
• /
• 1998

In this paper, we propose an efficient multi-view images coding algorithm which finds the optimal texture from the restricted number of multi-view images. The X-Y plane of the normalized object space is divided into triangular patches. The depth value of the node is determined by applying the block based disparity compensation method and then the texture of the each patch is extracted by applying the affine transformation patch is extracted by applying the affine transformation based disparity compensation method to the multi-view images. We restricted the number of images contributed to determining the texture comapred to traditional methods which use all the multi-view images in the texture extraction. Experimental results show that the SNR of images encoded by the proposed algorithm is better than that of imaes encoded by the traditional method by the amount about 0.2dB for the test sets of multi-view images called dragon, kid, city and santa. The recovered images from the encoded data by the proposed method show the better visual images than the recovered images from the encoded data by the traditional methods.

• Proceedings of the KSME Conference
• /
• 2007.05a
• /
• pp.1564-1569
• /
• 2007

This study concerns an advanced NURBS surface reconstruction method, which is based on the NURBS surface model fitting to the unstructured point cloud measured from an arbitrary complex shape. The concept of generating a simple triangular mesh model was introduced to generate a quadrilateral mesh model well-representing the topological characteristics of point cloud. The NURBS surface reconstruction processes required the use of the various methodologies such as QEM algorithm, merging scheme of pair-wise triangular mesh, creation algorithm of $G^1$ continuous tensor product NURBS surface patch, and so on. The effectiveness and reliability of the proposed NURBS surface reconstruction method were validated through the simulation results for the geometrically and topologically complex shapes.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 1998.03a
• /
• pp.129-134
• /
• 1998

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.