• 한국전산유체공학회:학술대회논문집
• /
• 한국전산유체공학회 2003년도 추계 학술대회논문집
• /
• pp.25-30
• /
• 2003

The numerical simulations with unstructured mesh by cell-centered and vertex-centered approaches were performed for the quadrilateral and triangular meshes. For the 2-D incompressible supersonic vortex flow, the simulation results and the analytic solution were compared and the accuracy was assessed. The calculation efficiency was measured by the parameter defined by the consumed CPU time multiplied by absolute error, As a results, equilateral triangular mesh yielded the best accuracy and efficiency among the tested meshes.

• 한국정밀공학회지
• /
• 제24권9호
• /
• pp.148-157
• /
• 2007

A new method which uses distance fields scheme and marching cube algorithm is proposed in order to get an accurate offset model of arbitrary shapes composed of triangular net. In the method, the space bounding the triangular net is divided into smaller cells. For the efficient calculation of distance fields, valid cells which will generate a portion of offset model are selected previously by the suggested detection algorithm. These valid cells are divided again into much smaller voxels which assure required accuracy. At each voxel distance fields are created by calculating the minimum distances between corner points of voxels and triangular net. After generating the whole distance fields, the offset surface were constructed by using the conventional marching cube algorithm together with mesh smoothing scheme. The effectiveness and validity of this new offset method was demonstrated by performing numerical experiments for the various types of triangular net.

• 대한산업공학회지
• /
• 제21권4호
• /
• pp.529-540
• /
• 1995

The paper deals with a procedure for constructing a composite surface interpolating a polygonal curve mesh defined from 3D scattered points. The procedure consists of a poly-angulation, construction of a curve net, and interpolation of the curve net. The poly-angulation contains a stage that changes a triangular edge net obtained from a triangulation into a poly-angular edge net. A curve net is constructed by replacing edges on the edge net with cubic Bezier curves. Finally, inside of an n-sided polygon is interpolated by n subdivided triangular subpatches. The method interpolates given point data with relatively few triangular subpatches. For an n-sided polygon, our method constructs an interpolant with n subdivided triangular subpatches while the existing triangular surface modeling needs 3(n-2) subpatches. The obtained surface is composed of quartic triangular patches which are $G^1$-continuous to adjacent patches.

• 한국CDE학회논문집
• /
• 제14권3호
• /
• pp.197-206
• /
• 2009

In a finite element analysis of the metal forming processes having large plastic deformation, largely distorted elements are unstable and hence they influence upon the result toward negative way so that adaptive remeshing is required to avoid a failure in the numerical computation. Therefore automatic mesh generation and regeneration is very important to avoid a numerical failure in a finite element analysis. In case of generating quadrilateral mesh, the automation is more difficult than that of triangular mesh because of its geometric complexity. However its demand is very high due to the precision of analysis. Thus, in this study, an automatic quadrilateral mesh generation and regeneration method using grid-based approach is developed. The developed method contains decision of grid size to generate initial mesh inside a two dimensional domain, classification of boundary angles and inner boundary nodes to improve element qualities in case of concave domains, and boundary projection to construct the final mesh.

• 방송공학회논문지
• /
• 제2권1호
• /
• pp.65-73
• /
• 1997

본 논문에서는 대용량 지형 정보 데이터를 효과적으로 3차원 도시하기 위하여 wavelet 변환을 이용한 효과적이고 새로운 삼각형 메쉬 근사 기법과 압축 저장 기법을 제안한다. 제안된 방법은 wavelet 변환 계수의 공간-주파수 지역제한 특성을 이용하여 지형정보 데이터를 영역분할하고 각 영역에 대해 삼각형 메쉬를 생성하므로써 계산량이 적고 알고리즘이 간단하다는 장점이 있다. 또한 Embedded Zerotree Wavelet 부호화 기법을 도입하여 지형 정보데이터의 효과적인 저장, 관리는 물론 삼각형 메쉬 구성기법에 적용하였다. 제안된 지형정보 데이터의 3차원 고속도시기에는 데이터 압축, 저장 및 Level of Detail 구현에 이르는 모든 기법을 통합되었으며 모의실험을 통하여 높은 PSNR, 고속 수행, 간단한 구현 등의 장점들을 갖는 것이 확인되었다.

• 한국컴퓨터그래픽스학회논문지
• /
• 제26권3호
• /
• pp.39-48
• /
• 2020

본 논문에서는 삼각 메쉬의 홀을 채우는 새로운 기법을 제시한다. 첫번째, 임의 모양의 홀을 검출한다. 두번째, 삼각화(triangulation), 세분화(refinement), 공정화(fairing), 스무딩(smoothing) 과정을 통해 소스 및 타겟 홀 패치를 생성한다. 마지막으로, 두 패치 사이의 형상 차이를 분석하고 패치간 블렌딩을 통해 특징이 강조된 홀 패치를 얻는다. 다양한 모양의 홀을 갖는 삼각 메쉬 모델에 홀 채움 기법을 적용하여 모델을 복원함으로써 제안된 기법의 효과성을 입증한다.

• 대한전자공학회논문지SP
• /
• 제39권2호
• /
• pp.22-29
• /
• 2002

본 논문에서는 삼각형으로 이루어진 3차원 메쉬 데이터의 영역화에 대한 알고리듬을 서술한다. 제안하는 알고리듬은 메쉬 표면을 구성하는 삼각형들의 방향성에 기반한 것으로, 인접한 삼각형 쌍들의 반복적인 병합을 이용한다 메쉬 표면은 각각의 영역이 비슷한 법선 벡터를 가지는 삼각형들로 구성되도록 여러 개의 영역으로 영역화된다. 따라서 각 영역은 평면 조각으로 근사될 수 있으며, 각 영역의 경계선은 인간이 전체 메쉬 모델을 지각적으로 이해하는데 있어서 중요한 기하학적인 정보를 포함한다. 실험 결과는 제안하는 알고리듬이 효율적으로 동작하고 있음을 보여준다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2007년도 하계종합학술대회 논문집
• /
• pp.203-204
• /
• 2007

In this work, we propose a compression algorithm for depth images, which are obtained from multi-view sequences. The proposed algorithm represents a depth image using a 3-D regular triangular mesh and predictively encodes the mesh vertices using a linear prediction scheme. The prediction errors are encoded with a arithmetic coder. Simulation results demonstrate that the proposed algorithm provides better performances than the JPEG2000 lossless coder.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2004년도 춘계공동학술대회 논문집
• /
• pp.44-47
• /
• 2004

This paper proposes an approach for composite surface reconstruction from 2D serial cross-sections, where the number of contours varies from section to section. In a triangular surface-based approach taken in most reconstruction methods, a triangular $G^{1}$ surface is constructed by stitching triangular patches over a triangular net generated from the compiled contours. In the proposed approach, the resulting surface is a composite $G^{1}$ surface consisting of three kinds of surfaces: skinned, surface is first represented by a B-spline surface approximating the serial contours of the skinned region and then serial contours of the skinned region and then transformed into a mesh of rectangular Bezier patches. On branched and capped regions, triangular $G^{1}$ surfaces are constructed so that the connections between the triangular surfaces and their neighboring surfaces are $G^{1}$ continuous. Since each skinned region is represented by an approximated rectangular $G^{2}$ surface instead of an interpolated triangular $G^{1}$ surface, the proposed approach can provide more visually pleasing surfaces and realize more efficient data reduction than the triangular surface-based approach. Some experimental results demonstrate its usefulness and quality.

• 한국CDE학회논문집
• /
• 제8권4호
• /
• pp.270-277
• /
• 2003

In two dimensional mechanical design analysis, quadrilateral element mesh is preferred because it provides more accurate result than triangular element mesh. However, automation of quadrilateral element mesh generation is much more complex because of its geometrical complexities. In this study, an automatic quadrilateral element mesh generation algorithm based on the boundary normal offsetting method and the boundary decomposition method is developed. In so doing, nodes are automatically placed using the boundary normal offsetting method and the decomposition method is applied to decompose the designed domain into a set of convex subdomains. The generated elements are improved by relocation of the existing nodes based on the four criteria - uniformity, aspect ratio, skewness and taper degree. The developed algorithm requires minimal user inputs such as boundary data and the distance between nodes.