• Journal of the Korean Society of Clothing and Textiles
• /
• v.29 no.9_10 s.146
• /
• pp.1359-1368
• /
• 2005

When we develop the tight-fit 2D pattern from the 3D scan data, segmentation of the 3D scan data into several parts is necessary to make a curved surface into a flat plane. In this study, Garland's method of triangle simplification was adopted to reduce the number of data point without distorting the original shape. The Runge-Kutta method was applied to make triangular patch from the 3D surface in a 2D plane. We also explored the detailed arrangement method of small 2D patches to make a tight-fit pattern for a male body. As results, minimum triangle numbers in the simplification process and efficient arrangement methods of many pieces were suggested for the optimal 2D pattern development. Among four arrangement methods, a block method is faster and easier when dealing with the triangle patches of male's upper body. Anchoring neighboring vertices of blocks to make 2D pattern was observed to be a reasonable arrangement method to get even distribution of stress in a 2D plane.

• Journal of the Korea Computer Graphics Society
• /
• v.25 no.3
• /
• pp.75-83
• /
• 2019

In this paper we present a new technique for simultaneously simplifying N triangule meshes with the same number of vertices and the same connectivities. Applying the existing simplification technique to each of the N triangule mesh creates a simplified mesh with the same number of vertices but different connectivities. These limits make it difficult to construct a simplified blend-shape model in a high-resolution blend-shape model. The technique presented in this paper takes into account the N meshes simultaneously and performs simplification by selecting an edge with minimal removal cost. Thus, the N simplified meshes generated as a result of the simplification retain the same number of vertices and the same connectivities. The efficiency and effectiveness of the proposed technique is demonstrated by applying simultaneous simplification technique to multiple triangle meshes.

• Fibers and Polymers
• /
• v.7 no.2
• /
• pp.195-202
• /
• 2006

Tight-fitting clothing pattern reflecting the accurate information of the 3D body shape has been one of the challenges for garment industry, however, fitting problems still exist. The objectives of the paper is to develop a 2D pattern which fits tightly to the 3D human scan data for sports suits that need comfort and function for maximum performance. In this study, the user graphic interface application software for the semi-automatic garment pattern generation has been implemented using the triangle simplification scheme together with 2D projections of free-falling of 3D surface polygons keeping the original 3D surface area preservation. A typical application of the developed pattern to the functional body suits is presented and verification of the proposed method is also provided.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.5
• /
• pp.87-96
• /
• 2005

In this paper, a mesh simplification algorithm using face constriction is proposed which considers the conservation of the volume of a 3D model. The face constriction method replaces three vertices of the candidate triangle with a new vertex, removing four faces at once. We propose a modified method, compensating an existing method, of considering curvature in the decision of the removing order of triangles. We also propose a method of determining a new vertex replacing the candidate triangle, which reflects curvature difference of the three surrounding areas of the three vertices of the triangle, while conserving the volume. It is shown by simulation that the proposed method conserves the volume and shows good constriction performance comparable to the other methods.

• Journal of the Korean Society of Clothing and Textiles
• /
• v.30 no.5 s.153
• /
• pp.722-732
• /
• 2006

The pattern making of the tight-fitting collars which often used in diving suits, dance wear, or cycle wear has not been fully established. To develop tight-fitting collar pattern directly from 3D images from the representative somatotypes, dressforms developed by Jaeun Jung were used. The 3D scan data of the four male dressforms were obtained using Exyma-1200. Triangle Simplification and the Runge-Kutta method were applied to reduce the 3D scan data points and to make the segmented triangular patches in a plane from 3D data. As results, apparent differences between the tight-fitting collar patterns obtained from the 3D scan data and the ordinary 2D collar patterns were found around the center back line. The curvatures of the center back line were higher in all types of the tight-fitting collar than in the ordinary collar pattern. Relative differences in the shape of collar lines among four representative Korean men were reported. To fit the curved shape of the back neckline, 1.8 cm should be reduced from the upper neckline in average. We suggested the direct pattern making method for the 2D tight-fitting collar patterns considering the 3D shape of various types of men's dressform.

• Journal of Korea Multimedia Society
• /
• v.5 no.4
• /
• pp.458-467
• /
• 2002

There has been proposed many simplification algorithms for effectively decreasing large-volumed polygonal surface data. These algorithms apply their own cost function for collapse to one of fundamental simplification unit, such as vertex, edge and triangle, and minimize the simplification error occurred in each simplification steps. Most of cost functions adopted in existing works use the error estimation method based on distance optimization. Unfortunately, it is hard to define the local characteristics of surface data using distance factor alone, which is basically scalar component. Therefore, the algorithms cannot preserve the characteristic features in surface areas with high curvature and, consequently, loss the detailed shape of original mesh in high simplification ratio. In this paper, we consider the vector component, such as surface orientation, as one of factors for cost function. The surface orientation is independent upon scalar component, distance value. This means that we can reconsider whether or not to preserve them as the amount of vector component, although they are elements with low scalar values. In addition, we develop a simplification algorithm based on half-edge collapse manner, which use the proposed cost function as the criterion for removing elements. In half-edge collapse, using one of endpoints in the edge represents a new vertex after collapse operation. The approach is memory efficient and effectively applicable to the rendering system requiring real-time transmission of large-volumed surface data.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.37 no.2
• /
• pp.9-18
• /
• 2014

The purpose of this research is to initiate discussion to simplify existing tools and methods for managing projects which make project management a harder job to perform and a tougher task to handle. Additionally, summarizing the definitions of "project" that have been found from reviewing the relevant literature, it deliberates on revising the duties and responsibilities of project manager and proposes performance expectancy triangle explaining a relationship among accountability, responsibility and authority - the Tri-butes. It sheds light on several factors critical to the success of projects. Finally, we propose a function indicating that customer demands or desires greatly affect project complexity.

• Korean Journal of Computational Design and Engineering
• /
• v.9 no.4
• /
• pp.294-305
• /
• 2004

Highly detailed geometric models are rapidly becoming commonplace in computer graphics and other applications. These complex models, which is often represented as complex1 triangle meshes, mainly suffer from the vast memory requirement for real-time manipulation of arbitrary geometric shapes without loss of data. Various techniques have been devised to challenge these problems in views of geometric processing, not a representation scheme. This paper proposes the new mesh structure for the compact representation and the efficient handling of the highly complex models. To verify the compactness and the efficiency, the memory requirement of our representation is first investigated and compared with other existing representations. And then we analyze the time complexity of our data structure by the most critical operation, that is, the enumeration of the so-called one-ring neighborhood of a vertex. Finally, we evaluate some elementary modeling functions such as mesh smoothing, simplification, and subdivision, which is to demonstrate the effectiveness and robustness of our mesh structure in the context of the geometric modeling and processing.

• The Magazine of the IEIE
• /
• v.30 no.6
• /
• pp.42-42
• /
• 2003

최근 급증하는 디지털 멀티미디어 정보를 보호하기 위해 다양한 종류의 디지털 워터마킹 방법들이 개발되고 있다. 본 논문에서는 디지털 워터마킹의 기본 원리를 살펴보고, 삼각형 스트립(triangle strip)을 이용한 삼차원 모델에 대한 연성 워터마킹 (fragile watermarking) 방법을 제안한다. 사용자 키(key) 값으로 생성된 이진 무작위 시퀀스는 배타적 논리합(exclusive OR) 연산을 통해 이진 워터마크 시퀀스와 결합한 후, 꼭지점 좌표(vertex coordinates)를 변동시켜 삼각형 스트립에 삽입된다. 컴퓨터 모의 실험을 통해, 제안한 워터마킹 방법이 무작위 잡음 첨가(additive random noise), 이동, 회전, 비례 축소(scaling), 폴리곤 간략화(polygon simplification), 기하 정보 압축 (geometry compression) 등과 같은 삼차원 모델에 대한 다양한 공격을 검출할 수 있으며 변조된 위치를 표시할 수 있다는 것을 보였다.

• The Magazine of the IEIE
• /
• v.30 no.6
• /
• pp.608-614
• /
• 2003

최근 급증하는 디지털 멀티미디어 정보를 보호하기 위해 다양한 종류의 디지털 워터마킹 방법들이 개발되고 있다. 본 논문에서는 디지털 워터마킹의 기본 원리를 살펴보고, 삼각형 스트립(triangle strip)을 이용한 삼차원 모델에 대한 연성 워터마킹 (fragile watermarking) 방법을 제안한다. 사용자 키(key) 값으로 생성된 이진 무작위 시퀀스는 배타적 논리합(exclusive OR) 연산을 통해 이진 워터마크 시퀀스와 결합한 후, 꼭지점 좌표(vertex coordinates)를 변동시켜 삼각형 스트립에 삽입된다. 컴퓨터 모의 실험을 통해, 제안한 워터마킹 방법이 무작위 잡음 첨가(additive random noise), 이동, 회전, 비례 축소(scaling), 폴리곤 간략화(polygon simplification), 기하 정보 압축 (geometry compression) 등과 같은 삼차원 모델에 대한 다양한 공격을 검출할 수 있으며 변조된 위치를 표시할 수 있다는 것을 보였다.