• Journal of Korea Multimedia Society
• /
• v.13 no.12
• /
• pp.1748-1759
• /
• 2010

We extend the octree subdivision process from Cartesian coordinates to spherical coordinates to develop more efficient space-partitioning structure for surface models. As an application of the proposed structure, we apply the octree subdivision in spherical coordinates ("S-Octree") to geometry compression in progressive mesh coding. Most previous researches on geometry-driven progressive mesh compression are devoted to improve predictability of geometry information. Unlike this, we focus on the efficient information storage for the space-partitioning structure. By eliminating void space at initial stage and aligning the R axis for the important components in geometry information, the S-Octree improves the efficiency in geometry information coding. Several meshes are tested in the progressive mesh coding based on the S-Octree and the results for performance parameters are presented.

• 한국전산유체공학회:학술대회논문집
• /
• 2001.10a
• /
• pp.152-156
• /
• 2001

Three dimensional orthogonal grid generation is able to control effectively the grid spacing near the boundaries, but there are some difficulty to meshing complex geometry. The mesh complex geometry by orthogonal grid generation method must divide block of geometry It is required a careful skill, and long time. Its also difficulty to make unstructured mesh on complex geometry. Particularly, three dimensional geometry must have more time and effort. Recently, there have been growing interests in mesh generation of complex grometry, aslike an automobile headlamp, the heart. The method of easily meshing complex geometry is resarched to solve them. We suggest octree grid into one among these methods. As octrce grid is automaticaly adapted at the boundaries by determine the level operations to control the grid spacing near the boundaries are unnecessary. In this paper we showed throe dimensional mesh generation, and heat-flow analysis on the octree mesh.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.18 no.12
• /
• pp.3159-3174
• /
• 1994

A simple octree encoding algorithm based on a tetrahedron root has been developed to be used for fully automatic generation of three dimensional finite element meshes. This algorithm starts octree decomposition from a tetrahedron root node instead of a hexahedron root node so that the terminal mode has the same topology as the final tetrahedral mesh. As a result, the terminal octant can be used as a tetrahedral finite element without transforming its topology. In this part(I) of the thesis, an efficient algorithm for the tetrahedron-based octree is proposed. For this development, the following problems have been solved, : (1) an efficient data structure for storing the octree and finite elements, (2) an encoding scheme of a tetrahedral octree, (3) a neighbor finding technique for the tetrahedron-based octree.

• Korean Journal of Computational Design and Engineering
• /
• v.12 no.2
• /
• pp.109-117
• /
• 2007

Three-dimensional mesh models have been widely used in various applications such as simulations, animations, and e-catalogs. In such applications the normal vectors of mesh models are used mainly for shading and take up the major portion of data size and transmission time paper over networks. Therefore a variety of techniques have been developed to compress them efficiently. In this paper, we propose the MOEC (Modified Octree Encoding Compression) algorithm, which allow multi lever compression ratios for 3D mesh models. In the algorithm, a modified octree has nodes representing their own positions and supporting a depth of the tree so that the normal vectors are compressed up to levels where the shading is visually indistinguishable. This approach provides efficient in compressing normals with multi-level ratios, without additional encoding when changing in compression ratio is required.

• 한국전산유체공학회:학술대회논문집
• /
• 2003.10a
• /
• pp.58-59
• /
• 2003

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.19 no.3
• /
• pp.647-660
• /
• 1995

Given the tetrahedron-based octree approximation of a solid as described in part(I) of this thesis, in this part(II) a systematic procedure of 'boundary moving' is developed for the fully automatic generation of 3D finite element meshes. The algorithm moves some vertices of the octants near the boundary onto the exact surface of a solid without transforming the topology of octree leaf elements. As a result, the inner octree leaf elements can be used as exact tetrahedral finite element meshes. In addition, as a quality measure of a tetrahedral element, 'shape value' is propopsed and used for the generation of better finite elements during the boundary moving process.

• Journal of the Korea Computer Graphics Society
• /
• v.18 no.1
• /
• pp.29-34
• /
• 2012

High-quality tetrahedral meshes are crucial for FEM-based simulation of large elasto-plastic deformation and tetrahedral-mesh-based simulation of fluid flow. This paper proposes a volume meshing method that exploits an octree-based adaptive signed distance field to fill the inside of a polygonal object with tetrahedra, of which dihedral angles are good. The suggested method utilizes an octree structure to reduce the total number of tetrahedra by space-efficiently filling an object with graded tetrahedra. To obtain a high-quality mesh with good dihedral angles, we restrict the octree in such a way that any pair of neighboring cells only differs by one level. In octree-based tetrahedral meshing, the signed distance computation of a point to the surface of a given object is a very important and frequently-called operation. To accelerate this operation, we develop a method that computes a signed distance field directly on the vertices of the octree cells while constructing the octree using a top-down approach. This is the main focus of the paper. The suggested tetrahedral meshing method is fast, stable and easy to implement.

• Journal of the Korea Computer Graphics Society
• /
• v.17 no.2
• /
• pp.45-53
• /
• 2011

This paper proposes a volume meshing method that fills the inside of an object with tetrahedra, of which dihedral angles are good. The suggested method is fast, stable and easy to implement It can also utilize an octree structure to space-efficiently fill an object with graded tetrahedra by reducing the total number of tetrahedra. To obtain a high-quality mesh with good dihedral angles, we restrict the octree such that any pair of neighboring cells only differs by one level. To efficiently construct a restricted-octree and generate a volume mesh from the octree, we utilize a signed distance field of an object on its bounded workspace. The suggested method can be employed in FEM-based simulation of large elasto-plastic deformation and tetrahedral-mesh-based simulation of fluid flow.

• 한국전산유체공학회:학술대회논문집
• /
• 2000.10a
• /
• pp.86-91
• /
• 2000

Automatic method for generation of mesh and three dimension natural convection flow result adapted by this method are presented in this paper. It lake long time to meshing com plex 3-D geometries, and It's difficult to clustering grid at surface boundary. Octree structure resolve this difficulty.

• Structural Engineering and Mechanics
• /
• v.15 no.1
• /
• pp.135-149
• /
• 2003

The bubble packing method is implemented for adaptive mesh generation in two and three dimensions. Bubbles on the boundary of a three-dimensional domain are controlled independently of the interior bubbles in the domain, and a modified octree technique is employed to place initial bubbles in the three-dimensional zone. Numerical comparisons are made with other mesh generation techniques to demonstrate the effectiveness of the present bubble packing scheme for two- and three-dimensional domains. It is shown that this bubble packing method provides a high quality of mesh and affordable control of mesh density as well.