• 한국CDE학회논문집
• /
• 제10권1호
• /
• pp.27-39
• /
• 2005

Implicit surfaces are geometric shapes which are defined by implicit functions and exist in three-dimensional space. Recently, implicit surfaces have received much attention in solid modeling applications because they are easy to represent the location of points and to use boolean operations. However, it is difficult to chart points on implicit surfaces for rendering. As efficient rendering method of implicit surfaces, the original Adaptively Sampled Distance Fields (ADFs) $method^{[1]}$ is to use sampled distance fields which subdivide the three dimensional space of implicit surfaces into many cells with high sampling rates in regions where the distance field contains fine detail and low sampling rates where the field varies smoothly. In this paper, in order to maintain the sharp features efficiently with small number of cells, an extended ADFs method is proposed, applying the Dual/Primal mesh optimization $method^{[2]}$ to the original ADFs method. The Dual/Primal mesh optimization method maintains sharp features, moving the vertices to tangent plane of implicit surfaces and reconstructing the vertices by applying a curvature-weighted factor. The proposed extended ADFs method is applied to several examples of implicit surfaces to evaluate the efficiency of the rendering performance.

• 한국소성가공학회:학술대회논문집
• /
• 한국소성가공학회 2001년도 추계학술대회 논문집
• /
• pp.81-84
• /
• 2001

An inverse finite element approach is employed for more capability to design the optimum blank shape from the desired final shape with small amount of computation time and effort. In some drawing or stamping simulation with inverse method, it is difficult to apply inverse scheme due to the large aspect ratio or steep vertical angle of inclination. The reason is that initial guesses are hard to make out with present method for those cases. In this paper, a direct mesh marring scheme to generate initial guess on the sliding constraint surface described by finite element patches is suggested for one step inverse analysis to calculate initial blank shape. Radial type mapping is adopted for the simulation of rectangular cup drawing process with large aspect ratio and parallel type mapping for the simulation of S-Rail forming process with steep vertical angle of inclination.

• 한국CDE학회논문집
• /
• 제11권3호
• /
• pp.157-163
• /
• 2006

Surfaces of many engineering structures, especially, those of ships are commonly made out of either single- or double-curved surfaces to meet functional requirements. The first step in the fabrication process of a three-dimensional design surface is unfolding or flattening the surface, otherwise known as planar development, so that manufacturers can determine the initial flat plate which is required to form the design shape. In this paper, an algorithm for optimal approximated development of a general curved surface, including both single- and double-curved surfaces, is established by minimizing the strain energy of deformation from its planar development to the design surface. The unfolding process is formulated into a constrained nonlinear programming problem, based on the deformation theory and finite element. Constraints are subjected to the characteristics of the fabrication method. And the design surface, or the curved shell plate is subdivided by automatic mesh generation.

• 대한산업공학회지
• /
• 제23권1호
• /
• pp.215-222
• /
• 1997

This paper deals with the problem of generating a uniform tetrahedral mesh which fills a 3-D space with the tetrahedra which are close to the equilateral tetrahedra as possible. This problem is particularly interesting in finite element modeling where a fat triangulation minimizes the error of an analysis. Fat triangulation is defined as a scheme for generating an equilateral triangulation as possible in a given dimension. In finite element modeling, there are many algorithms for generating a mesh in 2-D and 3-D. One of the difficulties in generating a mesh in 3-D is that a 3-D object can not be filled with uniform equilateral tetrahedra only regardless of the shape of the boundary. Fat triangulation in 3-D has been proved to be the one which fills a 3-D space with the tetrahedra which are close to the equilateral as possible. Topological and geometrical properties of the fat triangulation and its application to meshing algorithm are investigated.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 ITC-CSCC -1
• /
• pp.462-465
• /
• 2000

It is important to compress three dimensional (3D) data efficiently, since 3D data are too large to store or transmit in general. In this paper, we propose a lossless compression algorithm of the 3D mesh connectivity, based on the vertex degree. Most techniques for the 3D mesh compression treat the connectivity and the geometric separately, but our approach attempts to exploit the geometric information for compressing the connectivity information. We use the geometric angle constraint of the vertex fanout pattern to predict the vertex degree, so the proposed algorithm yields higher compression efficiency than the conventional algorithms.

• Journal of Computational Design and Engineering
• /
• 제1권1호
• /
• pp.1-12
• /
• 2014

In this paper, we propose a new method of reconstructing the hand models for individuals, which include the link structure models, the homologous skin surface models and the homologous tetrahedral mesh models in a reference posture. As for the link structure model, the local coordinate system related to each link consists of the joint rotation center and the axes of joint rotation, which can be estimated based on the trajectories of optimal markers on the relative skin surface region of the subject obtained from the motion capture system. The skin surface model is defined as a three-dimensional triangular mesh, obtained by deforming a template mesh so as to fit the landmark vertices to the relative marker positions obtained motion capture system. In this process, anatomical dimensions for the subject, manually measured by a caliper, are also used as the deformation constraints.

• Journal of Electrical Engineering and Technology
• /
• 제6권6호
• /
• pp.867-873
• /
• 2011

A navigation mesh (NavMesh) is a suitable tool for the representation of a three-dimensional game world. A NavMesh consists of convex polygons covering free space, so the path can be found reliably without detecting collision with obstacles. The main disadvantage of a NavMesh is the huge state space. When the $A^*$ algorithm is applied to polygonal meshes for detailed terrain representation, the pathfinding can be inefficient due to the many states to be searched. In this paper, we propose a method to reduce the number of states searched by using visibility tests to achieve fast searching even on a detailed terrain with a large number of polygons. Our algorithm finds the visible vertices of the obstacles from the critical states and uses the heuristic function of $A^*$, defined as the distance to the goal through such visible vertices. The results show that the number of searched states can be substantially reduced compared to the $A^*$ search with a straight-line distance heuristic.

• 한국전산유체공학회지
• /
• 제16권1호
• /
• pp.30-35
• /
• 2011

In this paper, our effort to apply 3-D Virtual Reality system for stereoscopic visualization of mesh data on the web is briefly described. This study is an extension of our previous and on-going research efforts to develop an automatic grid generation program specialized for wing mesh, named as eGWing. The program is developed by using JAVA programming language, and it can be used either as an application program on a local computer or as an applet in the network environment. In this research advancing layer method(ALM) augmented by elliptic smoothing method is used for the structured grid generation. And to achieve a stereoscopic viewing capability, two graphic windows are used to render its own viewing image for the left and right eye respectively. These two windows are merged into one image using 3D monitor and the viewers can see the mesh data visualization results with stereoscopic depth effects by using polarizing glasses. In this paper three dimensional mesh data visualization with stereoscopic technique combined with 3D monitor is demonstrated, and the current achievement would be a good start-up for further development of low-cost high-quality stereoscopic mesh data visualization system which can be shared by many users through the web.

• 방송공학회논문지
• /
• 제13권3호
• /
• pp.289-298
• /
• 2008

본 논문은 특이값 분해에 기반하여 다양한 화질을 지원하는 3차원 메쉬 동영상의 SNR 계층 부호화 기법을 제안한다. SVD는 메쉬 동영상을 적은 수의 기저 벡터들과 특이값들로 표현하여 부호화 성능을 높일 수 있다. 본 논문에서는 비트 평면 부호화를 적용한 후 각 이진화 단계와 화질 사이의 관계를 정량적으로 유도한다. 유도된 관계식을 이용하여 비트량-왜곡 측면에서 최적화된 부호화 순서를 정의한다. 또한 시공간 영역의 잉여 정보를 효율적으로 제거하는 예측 기법을 제시한다. 모의 실험을 통하여 제안하는 알고리듬이 다양한 SNR을 지원하며 기존의 기법에 비해 향상된 비트량-왜곡 성능을 발휘함을 보인다.

• 동력기계공학회지
• /
• 제18권3호
• /
• pp.59-65
• /
• 2014

The computational fluid dynamics was carried out to evaluate turbulent models on the swirling flow of a gun-type gas burner(GTGB) according to the mesh size. The commercial SC/Tetra software was used for a steady-state, incompressible and three-dimensional numerical analysis. In consequence, the velocity magnitude from the exit of a GTGB and the flowrate predicted by the turbulent models of MP k-${\varepsilon}$, Realizable k-${\varepsilon}$ and RNG k-${\varepsilon}$ agree with the results measured by an experiment very well. Moreover, the turbulent kinetic energy predicted by the turbulent model of standard k-${\varepsilon}$ with mesh type C only agrees with the experimental result very well along the radial distance. On the other hand, the detailed prediction of the information of swirling flow field near the exit of a GTGB at least needs a CFD analysis using a fairly large-sized mesh such as a mesh type C.