• Korean Journal of Computational Design and Engineering
• /
• v.13 no.6
• /
• pp.450-458
• /
• 2008

Recently, Cartesian grid approach has been popular to generate grid meshes for complex geometries in CFD (Computational Fluid Dynamics) because it is based on the non-body-fitted technique. This paper presents a method of an octree generation and boundary cell clipping using section curves for fast octree generation and elimination of redundant intersections between boundary cells and triangles from 3D triangular mesh. The proposed octree generation method uses 2D Scan-Converting line algorithm, and the clipping is done by parameterization of vertices from section curves. Experimental results provide octree generation time as well as Cut-cell clipping time of several models. The result shows that the proposed octree generation is fast and has linear relationship between grid generation time and the number of cut-cells.

• Korean Journal of Computational Design and Engineering
• /
• v.10 no.2
• /
• pp.107-113
• /
• 2005

Octree-based algorithm is developed for machining simulation. Most of commercial machining simulators are based on Z map model, which have several limitations to get a high precision in 5 axis machining simulation. Octree representation is three dimensional decomposition method. So it is expected that these limitations be overcome by using octree based algorithm. By using the octree model, storage requirement is reduced. And also recursive subdivision was processed in the boundaries, which reduces useless computation. The supersampling method is the most common form of the anti-aliasing and usually used with polygon mesh rendering in computer graphics. Supersampling technique is applied for advancing its efficiency of the octree algorithm.

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

The Dual Contouring method has an advantage over the primal polygonization methods like the Marching Cube method in terms of better expression of sharp features. In this paper, the Dual Contouring method is implemented in Spherical coordinates, not the Cartesian ones to examine some characteristics. For this purpose, our octree is defined in Spherical coordinates, which is called "S-Octree". Among some characteristics, the proposed Dual Contouring method in the S-Octree tends to produce less vertices at the same octree level. In particular, for any surface models close to surface sphere, the generated mesh surfaces are smoother and more detailed than those of the Cartesian Dual Contouring approach for specific applications including mesh compression where available geometric information is quite limited.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2004.10a
• /
• pp.422-425
• /
• 2004

This paper develops an octree-based algorithm for machining simulation. Most commercial machining simulators are based on the Z map model, which has several limitations in terms of achieving a high level of precision in five-axis machining simulation. Octree representation being a three-dimensional (3D) decomposition method, an octree-based algorithm is expected to be able to overcome such limitations. With the octree model, storage requirement is reduced. Moreover, recursive subdivision is processed in the boundaries, which reduces useless computations. The supersampling method is the most common form of antialiasing and is typically used with polygon mesh rendering in computer graphics. The supersampling technique is being used to advance the efficiency of the octree algorithm..

• Journal of Institute of Convergence Technology
• /
• v.10 no.1
• /
• pp.7-12
• /
• 2020

We describe a efficient surface reconstruction method that reconstructs a 3D manifold polygonal mesh approximately passing through a set of 3D oriented points. Our algorithm includes 3D convex hull, octree data structure, signed distance function (SDF), and marching cubes. The 3D convex hull provides us with a fast computation of SDF, octree structure allows us to compute a minimal distance for SDF, and marching cubes lead to iso-surface generation with SDF. Our approach gives us flexibility in the choice of the resolution of the reconstructed surface, and it also enables to use on low-level PCs with minimal peak memory usage. Experimenting with publicly available scan data shows that we can reconstruct a polygonal mesh from point cloud of sizes varying from 10,000 ~ 1,000,000 in about 1~60 seconds.

• Korean Journal of Computational Design and Engineering
• /
• v.11 no.2
• /
• pp.138-147
• /
• 2006

A systematic approach to tetrahedral element or mesh generation, based on an advancing-front method and an optimal triangular mesh generation technique on the surface, is presented in this paper. The possible internal nodes are obtained by the octree-decomposition scheme. The initial tetrahedral mesh system is constructed by the advancing-front method and then it is improved by the quality improvement processes including mesh swapping and nodal smoothing. The approach is evaluated by investigating the normalized length, the normalized volume, the dihedral angle and the normalized quality

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.10B
• /
• pp.1937-1945
• /
• 1999

In paper, we propose a 3D polygonal mesh simplification technique based on vertex clustering. The proposed method differentiates the size of each cluster according to the local property of a 3D object. We determine the size of clusters by considering the normal vector of triangles and the vertex distribution. The subdivisions of cluster are represented by octree. In this paper, we use the Harsdorff distance between the original mesh and the simplified one as a meaningful error value. Because proposed method adaptively determine the size of cluster according to the local property of the mesh, it has smaller error as compared with the previous methods and represent the small regions on detail. Also it can generate a multiresolution model and selectively refine the local regions.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.8
• /
• pp.8-16
• /
• 2016

This study presents the visualization of shape information based on Octree using 3D laser scanning. The process of visualization was established to construct the Octree structure from the 3D scan data. The scan data was converted to a 2D surface through the mesh technique and the surface was then converted to a 3D object through the Raster/Vector transformation. The 3D object was transmitted to the Octree Root Node and The shape information was constructed by the recursive partitioning of the Octree Root Node. The test-bed was selected as the steel bridge structure in Sungkyunkwan University. The shape information based on Octree was condensed into 89.3%. In addition, the Octree compressibility was confirmed to compare the shape information of the office building, a computer science campus in Germany and a New College in USA. The basis is created by the visualization of shape information for double-deck tunnel and it will be expected to improve the efficiency of structural health monitoring and maintenance.

• ETRI Journal
• /
• v.28 no.6
• /
• pp.697-708
• /
• 2006

Various adaptive mesh refinement techniques are often employed in numerical simulations for increasing spatial and temporal resolution beyond the limits imposed by available CPU time and memory space. Recently, an octree-based adaptive mesh structure was successfully used in fluid animation to place more grid cells efficiently in visually interesting regions of fluids. In an attempt to optimize the use of computational resources further in fluid animation, this paper extends this adaptive technique by modifying the mesh refinement scheme so that the camera's viewing properties are dynamically exploited during the simulation. Based on a simple adaptive mesh structure, we show that the new meshing strategy can save a substantial amount of computation time and memory space by using a view-dependent adaptive approach. The experimental results reveal that the proposed technique provides a good compromise between the computational effort and the simulation's fidelity, and may be used quite effectively in 3D animation production.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2005.05a
• /
• pp.209-214
• /
• 2005

In this paper, finite element simulation of three-dimensional bulk metal forming processes is performed by an automated adaptive tetrahedral mesh generation scheme. A dynamic data exchange scheme is employed between tetrahedral mesh generator and forging simulator to minimize user intervention. Both number of elements and density distributions are controlled by the octree technique. The presented approach is applied to automatic forging simulation in order to evaluate the efficiency of the developed schemes and the simulation results are compared with $DEFORM^{TM}$.