• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 하계종합학술대회 논문집(4)
• /
• pp.35-38
• /
• 2000

The method of Content-based Triangular Mesh Image representation in moving pictures makes better performance in prediction error ratio and visual efficiency than that of classical block matching. Specially if background and objects can be separated from image, the objects are designed by Irregular mesh. In this case this irregular mesh design has an advantage of increasing video coding efficiency. This paper presents the techniques of mesh generation, motion estimation using these mesh, uses image warping transform such as Affine transform for image reconstruction, and evaluates the content based mesh design through computer simulation.

• 한국수학교육학회지시리즈A:수학교육
• /
• 제31권2호
• /
• pp.121-132
• /
• 1992

FEM(Finite Element Method)의 pointwise convergence는 mesh size와 허용오차와의 관계를 분석해 보려는 것이다. 이들 상호 관계에 관한 연구는 FEM에 의한 근사식의 질을 높이는데 중요한 계기가 되어 결과 예측을 하는데 효과적이다. 본 논문은 1-irregular mesh를 이용한 세분화(refinement)로 미지점(unknon node)dlm 수를 최소화 하면서 원하는 점에서의 수렴성을 비교 분석하였다.

• 한국농공학회지
• /
• 제37권2호
• /
• pp.21-30
• /
• 1995

In order to save time and efforts in generating finite element meshes in irregular houndaries of domains, it is needed to develop an automatic mesh-generator which can hoth promote the accuracy of solutions and reduce the run-time in operating finite ele- ment models. In this study, the advancing front technique of triangular mesh generation and the transforming technique from triangular meshes to quadrilateral meshes were used to de- velop a computer program for the automatic triangular and quadrilateral meshes in the mixed shape. Furthermore, to enhance the quadrilateral mesh quality, the techniques of Laplancian smoothing and interior mesh modification were employed. The mesh genera- tor was applied to evaluate its applicability to irregular and complex geometries such as Nakdong river bay. In has hoen shown that the automatic mesh generator developed is capable of automatically generating meshes for irreguiar and complex geometries with high qualities of meshes and with the simple input data of arbitrarily specified nodal spacing in bound- aries.

• 한국통신학회논문지
• /
• 제16권11호
• /
• pp.1194-1200
• /
• 1991

유한요소법(Finite Element Method)은 컴퓨터를 이용하여 미분방정식의 근사해를 얻기위한 수학적인 기법이다. 유한요소법의 pointwise convergence는 매쉬 크기와 허용 오차와의 관계를 분석해 보려는 것이다. 이들 상호 관계에 과난 연구는 유한요소법에 의한 근사식의 질을 높이는데 중요한 계기가 되어 결과를 예측 하는데 효과적이다. 본 논문을 1-Irregular 매쉬를 이용한 세분화(refinement) 및 형상 함수의 차수 변화에 따른 미지절점(unknown node) 수의 증가에 따른 수렴성을 분석하였다.

• 한국CDE학회논문집
• /
• 제6권3호
• /
• pp.184-192
• /
• 2001

In this paper we present a remeshing algorithm for irregular meshes with boundaries. The irregular meshes are approximated by regular meshes where the topological regularity is essential for the multiresolutional analysis of the given meshes. Normal meshes are utilized to reduce the necessary data size at each resolution level of the regularized meshes. The normal mesh uses one scalar value, i.e., normal offset value which is based on the regular rule of a uniform subdivision, while other remeshing schemes use one 3D vector at each vertex. Since the normal offset cannot be properly used for the boundaries of meshes, we use a combined subdivision scheme which resolves a problem of the proposed normal offset method at the boundaries. Finally, we show an example to see the effectiveness of the proposed scheme to reduce the data size of a mesh model.

• 한국콘텐츠학회논문지
• /
• 제9권5호
• /
• pp.76-83
• /
• 2009

최근 공동 연결 관계와 연속적인 정점 위치들의 움직임으로 이루어진 메쉬들의 모임, 즉 메쉬 시퀀스를 압축하는 연구가 활발하게 이루어지고 있다. 본 논문은 Khodakovsky 등이 제시한 준균일 메쉬 압축방법에 기반한 메쉬 시퀀스의 압축 알고리즘을 제시하고자 한다. 준균일 메쉬 시퀀스로의 메쉬 재구성을 이용한 메쉬 시퀀스 압축 알고리즘은 크게 두 부분으로 이루어진다. 첫 번째 부분은 주어진 비균일 메쉬 시퀀스로부터 준균일 메쉬 시퀀스를 생성하는 것이다. 준균일 메쉬를 생성하기 위해 본 논문에서는 MAPS 알고리즘을 사용하였다. 하지만 단일 메쉬에 대해 적용이 가능한 MAPS 알고리즘을 메쉬 시퀀스에 그대로 적용할 수 없다. 따라서 주어진 애니메이션에서의 정점 움직임을 고려하여 유사한 움직임을 가지는 영역별로 분할하고, 이 분할 정보과 정점의 움직임을 고려할 수 있도록 MAPS 알고리즘을 확장하였다. 두 번째 단계에서는 웨이블릿 변형과 메쉬 분할 정보를 이용해 준균일 메쉬를 압축하였다. 각 분할 영역의 변환 정보를 고려해 분할 영역 내 정점의 위치를 예측하고, 참조 프레임과의 차이값을 압축함으로써 효율적으로 준균일 메쉬 시퀀스를 압축하였다.

• Structural Engineering and Mechanics
• /
• 제43권3호
• /
• pp.349-370
• /
• 2012

Variable-node finite element families, termed (4 + k + l + m + n)-node elements with an arbitrary number of nodes (k, l, m, and n) on each of their edges, are developed based on the generic point interpolation with special bases having slope discontinuities in two-dimensional domains. They retain the linear interpolation between any two neighboring nodes, and passes the standard patch test when subdomain-wise $2{\times}2$ Gauss integration is employed. Their shape functions are automatically generated on the master domain of elements although a certain number of nodes are inserted on their edges. The elements can provide a flexibility to resolve nonmatching mesh problems like mesh connection and adaptive mesh refinement. In the case of adaptive mesh refinement problem, so-called "1-irregular node rule" working as a constraint in performing mesh adaptation is relaxed by adopting the variable-node elements. Through several examples, we show the performance of the variable-node finite elements in terms of accuracy and efficiency.

• 대한임베디드공학회논문지
• /
• 제16권5호
• /
• pp.215-223
• /
• 2021

3D data can be categorized into two parts : Euclidean data and non-Euclidean data. In general, 3D data exists in the form of non-Euclidean data. Due to irregularities in non-Euclidean data such as mesh and point cloud, early 3D deep learning studies transformed these data into regular forms of Euclidean data to utilize them. This approach, however, cannot use memory efficiently and causes loses of essential information on objects. Thus, various approaches that can directly apply deep learning architecture to non-Euclidean 3D data have emerged. In this survey, we introduce various deep learning methods for mesh and point cloud data. After analyzing the operating principles of these methods designed for irregular data, we compare the performance of existing methods for shape classification and segmentation tasks.

• 한국CDE학회논문집
• /
• 제17권2호
• /
• pp.132-139
• /
• 2012

Presented in the paper is a procedure to extract simplified triangular mesh from a height map (terrain data). The proposed algorithm works directly on a height map that extracts a simplified triangular mesh. For the simplification, the paper employs an iterative method of edge contractions. To determine an edge to be contracted, the contraction cost of an edge is evaluated through the QEM method. Normally, an edge contraction will remove two triangles sharing the edge. Although the edge contraction can be implemented easily on a triangular mesh, it is not viable to implement the operation on a height map due to the irregular topology. To handle the irregular topology during the simplification procedure, a new algorithm is introduced.

• Structural Engineering and Mechanics
• /
• 제11권4호
• /
• pp.443-460
• /
• 2001

This paper presents an effective application of a variable-node axisymmetric solid element designated as AQV (Axisymmetric Quadrilateral Variable-node element). The variable-node element with physical midside nodes helps to overcome some problems in connecting the different layer patterns on a quadrilateral mesh in the adaptive h-refinement. This element alleviates the necessity of imposing displacement constraints on irregular (hanging) nodes in order to enforce the inter-element compatibility. Therefore, the elements with variable mid-side nodes can be used effectively in the local mesh refinement for the axisymmetric structures which have stress concentrations. A modified Gaussian quadrature should be adopted to evaluate the stiffness matrices of the variable-node elements mainly because of the slope discontinuity of assumed displacement within the elements. Some numerical examples show the usefulness of variable-node axisymmetric elements in the practical application.