• Journal of the KSME
• /
• v.32 no.2
• /
• pp.194-200
• /
• 1992

이 글에서는 가장 작은 각도의 하한값을 보장하는 이 차원에서의 메쉬 생성 알고리즘이 개발되 었다. 지금까지 유한 요소법에서는 어떠한 알고리즘도 메쉬질의 정도를 보장할 수 없었기 때문에 고르기 과정이 항상 필요하였다. 이 알고리즘은 또한 적은 메쉬생성(adaptive mesh generation) 에도 쓰일 수 있는데, 이러한 메쉬 생성법에서는 초기 메쉬를 생성한 다음 유한 요소법의 오차를 줄이기 위해 노우드를 하나씩 첨가하거나 제거한다. 따라서 여기서 소개된 알고리즘은 메쉬의 밀도를 조절하는데에도 사용된다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10b
• /
• pp.647-649
• /
• 1999

본 논문은 매쉬 분할시 생성되는 정점들과 그 점들의 극한위치와의 차이로 정의되는 근접거리 메트릭을 이용한 적응적 Loop 메쉬분할법을 제안한다. 근접거리 메트릭은 모든 approximation 분할법에 적용가능하며, 이 메트릭을 이용하여 초기메쉬를 사용자 입력 허용치에 따라 적응적으로 분할하여 적은 데이터로 극한메쉬에 근접한 결과를 생성할 수 있다. 또한, 본 논문에서 제시한 적응적 Loop 분할법은 다단계 메쉬표현이나 메쉬 편집 등 Loop 메쉬분할법이 사용되는 알고리즘에 유용하게 적용시킬 수 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10b
• /
• pp.502-504
• /
• 2000

본 논문은 연결정보가 없는 거리영상으로부터 DSM(Displaced Subdivision Mesh)을 복원하는 기술을 제안한다. DSM은 메쉬의 표면정보를 메쉬 분할법으로 생성한 부드러운 표면과의 차이값으로 표현할 수 있으므로 메쉬를 표현하는 데이터 크기를 획기적으로 줄일 수 있으며, 거리영상에 근접한 3차원 모델 복원기술에 효율적으로 적용될 수 있다. 제안 알고리즘은 기존 방법에서 사용하던 전역적 에너지 최소화 과정을 기하 해석적인 방법으로 대체하여 빠르게 메쉬를 복원할 수 있으며, 복원된 메쉬는 Remeshing을 거치지 않고 바로 다단계 표현으로 변환이 가능하다. 또한 입력 데이터를 고려한 라플라시안을 이용하여 거리영상에 최대한 근접하면서 지역적인 곡률이 최소화된 DSM을 생성한다. 이렇게 복원된 DSM은 메쉬 편집, 압축, 렌더링, 애니메이션 등 여러 응용분야에서 사용될 수 있다.

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

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.3
• /
• pp.513-518
• /
• 2016

This paper presents a fast 3D mesh generation method using projection for line laser-based 3D scanners. The well-known method for 3D mesh generation utilizes convex hulls for 4D vertices that is converted from the input 3D vertices. This 3D mesh generation for a large set of vertices requires a lot of time. To overcome this problem, the proposed method takes (${\theta}-y$) 2D depth map into account. The 2D depth map is a projection version of 3D data with a form of (${\theta}$, y, z) which are intermediately acquired by line laser-based 3D scanners. Thus, our 2D-based method is a very fast 3D mesh generation method. To evaluate our method, we conduct experiments with intermediate 3D vertex data from line-laser scanners. Experimental results show that the proposed method is superior to the existing method in terms of mesh generation speed.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.6
• /
• pp.307-317
• /
• 2002

In this paper we propose a new mesh reconstruction scheme that produces a displaced subdivision surface directly from unorganized points. The displaced subdivision surface is a new mesh representation that defines a detailed mesh with a displacement map over a smooth domain surface, but original displaced subdivision surface algorithm needs an explicit polygonal mesh since it is not a mesh reconstruction algorithm but a mesh conversion (remeshing) algorithm. The main idea of our approach is that we sample surface detail from unorganized points without any topological information. For this, we predict a virtual triangular face from unorganized points for each sampling ray from a parameteric domain surface. Direct displaced subdivision surface reconstruction from unorganized points has much importance since the output of this algorithm has several important properties: It has compact mesh representation since most vertices can be represented by only a scalar value. Underlying structure of it is piecewise regular so it ran be easily transformed into a multiresolution mesh. Smoothness after mesh deformation is automatically preserved. We avoid time-consuming global energy optimization by employing the input data dependant mesh smoothing, so we can get a good quality displaced subdivision surface quickly.

• Journal of Digital Convergence
• /
• v.11 no.8
• /
• pp.205-212
• /
• 2013

In this paper, we present a procedural modeling algorithms to create Korean traditional stone fence using the fractal subdivision. The main process of the algorithm is to get the next step mesh by subdividing each triangle in the previous step triangular mesh. This process is repeated recursively. Dividing each triangle into four sub-triangles after choosing a random point on each side of the triangle and moving each vertices in the normal direction with random perturbations make the bumpy appearance of stone fences. In each step we remove flat vertices which does not influence the shape of the stone. The discrete curvature determines the flatness of a vertex. New triangles whose vertices are the vertices around the removed vertex are added to make a triangular mesh.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2005.05b
• /
• pp.419-423
• /
• 2005

2차원 하천흐름. 유사이동, 오염확산 해석을 위해서는 유한요소법(FEM) 등을 활용한 수치해석 모델이 사용되며, 이 때 모델링을 위해서 모의영역은 2차원의 요소망으로 구성하게 된다. 기존 국내 연구에서는 이러한 2차원 요소망 생성 및 수치해석을 위해 SMS 및 CCHE2D와 같은 외국의 상용 프로그램을 이용하였으나, "수자원의 지속적 확보기술개발 사업"의 일환으로 수행중인 "RAMS(River Analysis and Modeling System) 개발" 과제를 통해 순수 국산 2차원 수리해석 소프트웨어가 개발 중에 있다. 본 연구에서는 RAMS를 비롯한 기타 수리해석 모델에서 사용 가능한 2차원 범용 요소망 생성 프로그램을 개발하고자 다양한 요소망 생성 기법 및 국외 상용 2차원 수리해석 모델 프로그램에서의 메쉬 생성방법 등을 분석하여 프로토타입 메쉬 생성기를 개발하였다. 현재 개발 중인 요소망 생성 프로그램은 요소망 생성을 위한 기본 기능 외에도 생성된 요소망 데이터를 RAMS에 포함되어 있는 다양한 2차원 유한요소 모형의 입력자료 형태로 변환함으로써 수리해석에 적용가능하다. 이러한 범용 2차원 요소망 생성 프로그램의 개발은 안정적인 수치해석의 기반을 제공하고 다양한 하천흐름, 유사, 수질 해석 모델과 연계함으로써 하천의 수리학적인 거동을 보다 정확히 모의할 수 있을 것으로 기대된다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.3
• /
• pp.479-485
• /
• 2007

In this paper, a hierarchical simulation with an approximate implicit method is proposed in order to efficiently and plausibly animate mass-spring based cloth models. The proposed hierarchical simulation method can generate realistic motion of extremely fine mesh in interactive rate. The proposed technique employs a fast and stable simulation method which approximates the implicit integration. Although the approximate method is efficient, it is extremely inaccurate and shows excessively damped behavior. The hierarchical simulation technique proposed in this paper constructs multi-level mesh structure in order to represent the realistic appearance of cloth model and performs simulation on each level of the mesh with constraints that enforce some of the mass-points of current level to follow the movement of the previous level. This hierarchical method efficiently generates a plausible movement of a cloth model composed of large number of mass points. Moreover, this hierarchical method enables us to generate realistic wrinkles on the cloth, and the wrinkle pattern on the cloth model can be easily controlled because we can specify different contraction resistance force of springs according to their hierarchical level.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.17 no.2
• /
• pp.88-94
• /
• 2003

In this paper, we propose a hierarchical triangular mesh generation method based on the motion information and a fast rude convergence method. From the variance of Image difference we decide the region that subdivision is required and perform the adequate triangulation method that is possible to yield a successive hierarchical triangulation. For fast node convergence, in initial search, we use the refinement method that separate the backgroung and object region and maintain the mesh connection by using the bilinear interpolation. The simulation result demonstrate that proposed triangulation method have performance in PSNR than the conventional BMA or order mesh based method and refinement is appropriate for the case of the mesh size is small.