• Proceedings of the Korean Society of Computer Information Conference
• /
• 2019.07a
• /
• pp.255-256
• /
• 2019

한글 폰트를 만드는 데는 자음+모음 조합으로 약 11,500자 정도의 글자가 필요하다. 디자이너가 글자 하나씩 전부 디자인 하는 것도 굉장한 부담요소이고, 한글폰트를 제작하는데 있어 3개월 이상의 소요 기간과 3000만 원 이상의 비용부담 또한 무시 못 할 요소이다. 게다가 카피라이트 폰트에 대한 저작권 문제 또한 골칫거리다. 그래서 이를 최소한으로 하고자 딥 러닝의 방식중 하나인 GAN(생성적 적대 신경망)을 통해서 디자이너가 399자만 작성하고 나머지는 컴퓨터가 디자이너의 폰트 디자인을 인식하고 자동으로 만들어 주는 프로그램을 고안하였다.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.31 no.7 s.262
• /
• pp.739-746
• /
• 2007

Recently, models in STL files are widely used in reverse engineering processes, CAD systems and analysis systems. However the models have poor geometric quality and include only triangles, so the models are not suitable for the finite element analysis. This paper presents a general method that generates finite element mesh from STL file models. Given triangular meshes, the method estimates triangles and makes clusters which consist of triangles. The clusters are merged by some geometric indices. After merging clusters, the method applies plane meshing algorithm, based on domain decomposition method, to each cluster and then the result plane mesh is projected into the original triangular set. Because the algorithm uses general methods to generate plane mesh, we can obtain both tri and quad meshes unlike previous researches. Some mechanical part models are used to show the validity of the proposed method.

• Korean Journal of Computational Design and Engineering
• /
• v.5 no.1
• /
• pp.95-101
• /
• 2000

For last two decades numerous automatic mesh generation algorithms for various two dimensional objects have been introduced continuously and among them triangular mesh generation schemes have been majority because of efficiency and controllability. In our study, an existing triangular mesh generation algorithm developed by Lo is totally modified to more improve node distribution, element shape, and objects shape independency. ft is composed of node generation part and element generation part. In order to find a suitable node position within geometry, the suggested algorithm searches desirable positions of points within boundary and optimizes node position to generate comparatively well-shaped elements. More over, the suggested algorithm handles various complex two dimensional objects and its meshing speed shows superiority to those of the existing triangulation mesh generation algorithms. It is fully automated in a sense of constructing object boundary and hence can be directly used as an independent meshing software.

• Journal of the Korean Society for Precision Engineering
• /
• v.20 no.6
• /
• pp.189-196
• /
• 2003

The NURBS surfaces are widely employed for exchanging geometric models between different CAD/CAE systems. However if the input NURBS surfaces are poorly parameterized, most surface meshing algorithms may fail or the constructed meshes can be ill-conditioned. In this paper presents a new method is presented that can generate well conditioned meshes even on poorly parameterized NURBS surfaces by regenerating NURBS surfaces. To begin with, adequate points are sampled on original poorly parameterized surfaces and new surfaces are created by interpolating these points. And then, mesh generation is performed on new surfaces. With this method, models with poorly parameterized NURBS surfaces can be meshed successfully.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2006.05a
• /
• pp.423-424
• /
• 2006

This paper proposes a hexahedral mesh generation scheme based on mapping approach and improves the drawback of sweeping algorithm. In order to improve the drawback, the algorithm in this paper generates hexahedral meshes by three dimensional element mapping first. Then hexahedral meshes are equivalent to geometry of the volume by mapping and smoothing. Sample meshes are constructed to demonstrate the mesh generating capability of the proposed algorithm.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2002.10a
• /
• pp.784-787
• /
• 2002

The NURBS surfaces are widely employed for exchanging geometric models between different CAD/CAE systems. However if the input NURBS surfaces are poorly parameterized, most surface meshing algorithms may fail or the constructed meshes can be ill-conditioned. In this paper presents a new method is presented that can generate well conditioned meshes even on poorly parameterized NURBS surfaces by regenerating NURBS surfaces. To begin with, adequate Points are sample on original poorly parameterized surfaces and new surfaces are created by interpolating these points. And then. mesh generation is performed on new surfaces. With this method, models with poorly parameterized NURBS surfaces can be meshed successfully.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.17 no.12
• /
• pp.2995-3006
• /
• 1993

An automatic mesh generation scheme has been developed for finite element analysis with two-dimensional, quadrilateral elements. The basic strategies of the method are to transform the analysis domain into loops with key nodes and the loops are recursively subdivided into subloops with the use of best split lines. Finally by using the basic loop operators, the meshes are completed. In this algorithm an eight-node loop operator is proposed, which is useful in the area where the change of element size is large and the splitting criteria for subdividing the loops have also been modified to the existing algorithms. Lines, arcs, and cubic spline curves are used to define the boundaries of analysis domain. Sample meshes for several geometries are presented to demonstrate the robustness of the algorithm.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.18 no.11
• /
• pp.2932-2943
• /
• 1994

An efficient approach to the automatic construction of effective quadrilateral finite element meshes for two-dimensional analysis is presented. The procedure is composed of, firstly, an initial mesh generation and, secondly, an h-version of adaptive refinement based on error analysis. As for an initial mesh generation scheme, a modified looping algorithm has been employed. For the adaptive refinement process, an error indicator obtained by computing the residual error of the equilibrium equations in the energy norm with a relaxation factor has been employed. Examples of mesh generation and self-adaptive mesh improvements are given. These example solutions demonstrate that an effective mesh for a given error tolerance can be obtained in a few steps of the analysis processes.

• Journal of the korean Society of Automotive Engineers
• /
• v.18 no.4
• /
• pp.67-87
• /
• 1996

본 연구에서는 차체의 충돌해석 및 모델링을 위하여 판/쉘 요소의 자동생성 모듈을 개발하고 재료의 변형특성 모델링 모듈 및 접촉처리 모듈을 개발하였다. 충돌해석용 전처리기능으로는 평면, 실린더 곡면, B-스플라인 곡면 및 블렌딩 (blending) 곡면상에서의 사각형 요소망 자동생성 기법과 프로그램을 개발하였다. 또한 차체를 구성하고 있는 여러가지 재료들의 변형거동을 모델링하여 개발중인 충돌해석전용프로그램인 Autocrash의 모듈로서 완성하였다. 이들은 변형률속도의 영향이 고려된 탄소성 재료, 강체 재료, 포옴 재료 및 이방성 재료등으로 정면충돌 해석 및 측면충돌 해석에 필요하다. 한편 접촉처리 모듈에서 접촉탐색법으로는 주종탐색법과 HITA 알고리즘을 병행하여 사용할 수 있도록 프로그래밍하였으며, 불침투 조건의 처리는 벌칙함 수법을 이용하였다.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.3 no.6
• /
• pp.145-153
• /
• 1995

An algorithm for the automatic generation of quadrilateral shell elements on three-dimensional sculptured surfaces has been developed, which is one of the key issues in the finite element analysis of structures with complex shapes such as automobile structures. Mesh generation on sculptured surfaces is performed in three steps. First a sculptured surface is transformed to a projection plane, on which the loops are subdivided into subloops by using the best split lines, and with the use of 6-node/8-node loop operators and a layer operator, quadrilateral finite elements are constructed on this plane. Finally, the constructed mesh is transformed back to the original sculptured surfaces. The proposed mesh generation scheme is suited for the generation of non-uniform meshes so that it can be effectively used when the desired mesh density is available. Sample meshes are presented to demonstrate the versatility of the algorithm.