• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.31 no.10
• /
• pp.1-9
• /
• 2003

In GRID environments, an efficient load balancing algorithm should be adopted since the system performances of GRID system are not homogeneous. In this work, a new two-step mesh-partitioning scheme based on the graph-partitioning scheme was introduced to consider the difference of system performance. In the two-step mesh-partitioning scheme, the system performance weights were calculated to reflect the effect of heterogeneous system performances and WEVM(Weighted Edge and vertex Method) was adopted to minimize the increase' of communications. Numerical experiments were carried out in multi-cluster environment and WAN (Wide Area Network) environment to investigate the effectiveness of the two-step mesh-partitioning scheme.

• Journal of Computing Science and Engineering
• /
• v.4 no.3
• /
• pp.207-224
• /
• 2010

This paper presents a compression scheme for mesh geometry, which is suitable for mobile graphics. The main focus is to enable real-time decoding of compressed vertex positions while providing reasonable compression ratios. Our scheme is based on local quantization of vertex positions with mesh partitioning. To prevent visual seams along the partitioning boundaries, we constrain the locally quantized cells of all mesh partitions to have the same size and aligned local axes. We propose a mesh partitioning algorithm to minimize the size of locally quantized cells, which relates to the distortion of a restored mesh. Vertex coordinates are stored in main memory and transmitted to graphics hardware for rendering in the quantized form, saving memory space and system bus bandwidth. Decoding operation is combined with model geometry transformation, and the only overhead to restore vertex positions is one matrix multiplication for each mesh partition. In our experiments, a 32-bit floating point vertex coordinate is quantized into an 8-bit integer, which is the smallest data size supported in a mobile graphics library. With this setting, the distortions of the restored meshes are comparable to 11-bit global quantization of vertex coordinates. We also apply the proposed approach to compression of vertex attributes, such as vertex normals and texture coordinates, and show that gains similar to vertex geometry can be obtained through local quantization with mesh partitioning.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.6
• /
• pp.132-140
• /
• 2003

In this paper, we propose a new scheme for view-dependent transmission of three-dimensional (3-D) polygonal mesh models with hierarchial partitioning. In order to make a view-dependent representation of 3-D mesh models, we combine sequential and progressive mesh transmission techniques. By setting higher priorities to visible parts than invisible parts, we can obtain good qualify of 3-D models in a limited transmission bandwidth. In this paper, we use a multi -layer representation of 3-D mesh models based on hierarchical partitioning. After representing the 3-D mesh model in a hierarchical tree, we determine resolutions of partitioned submeshes in the last level. Then, we send 3-D model data by view-dependent selection using mesh merging and mesh splitting operations. By the partitioned mesh merging operation, we can reduce the joint boundary information coded redundantly in the partitioned submeshes. We may transmit additional mesh information adaptively through the mesh spritting operation.

• Journal of the Korea Computer Graphics Society
• /
• v.22 no.2
• /
• pp.20-26
• /
• 2016

This paper proposes an automatic hexahedral mesh generation method, in which internal medial surfaces are established to partition a region using the face-offsetting method. In order to test the usability of the suggested method, aspect ratios and Jacobians of the generated mesh for two models are evaluated and compared with ones from existing methods. It is verified that the proposed medial surface generation and partitioning scheme based on the face-offsetting method can be effectively used in the automatic hexahedral mesh generation procedure.

• Journal of computational fluids engineering
• /
• v.5 no.2
• /
• pp.20-27
• /
• 2000

An unstructured implicit Euler solver is parallelized on a Cray T3E. Spatial discretization is accomplished by a cell-centered finite volume formulation using an upwind flux differencing. Time is advanced by the Gauss-Seidel implicit scheme. Domain decomposition is accomplished by using the k-way n-partitioning method developed by Karypis. In order to analyze the parallel performance of the solver, flows over a 2-D NACA 0012 airfoil and 3-D F-5 wing were investigated.

• 한국전산유체공학회:학술대회논문집
• /
• 1999.11a
• /
• pp.193-200
• /
• 1999

An unstructured implicit Euler solver is parallelized on a Cray T3E. Spatial discretization is accomplished by a cell-centered finite volume formulation using an unpwind flux differencing. Time is advanced by the Gauss-Seidel implicit scheme. Domain decomposition is accomplished by using the k-way N-partitioning method developed by Karypis. In order to analyze the parallel performance of the solver, flows over a 2-D NACA 0012 airfoil and a 3-D F-5 wing were investigated.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.37 no.5
• /
• pp.433-441
• /
• 2009

Generally, the events in nature have multi-disciplinary characteristics. To solve this problems, these days loosely coupled methods are widely applied because of advantage of solvers which are already developed and well proved. Those solvers use different mesh system, so transformation and mapping of data are vital in the field of fluid-structure interaction(FSI). In this paper, the interpolation of deformation which is used globally and compactly supported radial basis functions(RBF), and mapping of force which use principle of virtual work are examined for computing time and accuracy to compare ability with simple 3-D problem. As the results, interpolation scheme of compactly supported radial basis functions are useful to interpolation and mapping for large-scale airplane in FSI with a k-dimensional tree(kd-tree) which is a space-partitioning data structure for organizing points in a k-dimensional space.