• Proceedings of the Korean Society of Propulsion Engineers Conference
• /
• 2017.05a
• /
• pp.776-777
• /
• 2017

The grain burn-back analysis has been required for the calculation of the solid propellant performance. The conventional grain burn-back analysis uses the level set method, but problems in the moving surface analysis may occur. In this study, the face offsetting method has been used for analyzing the moving surface. As results, the face offsetting method has been proven to be useful method for the grain burn-back analysis.

• Journal of the Korean Society of Propulsion Engineers
• /
• v.23 no.4
• /
• pp.81-91
• /
• 2019

The 3-dimensional grain burn-back analysis is performed using the face offsetting method for calculating the solid rocket motor performance. The grain burning configuration analysis is a moving surface problem that calculates the regression of the burning surface. In the previous study, various moving interface analysis methods were applied for the grain burn-back analysis, but the results were imperfect. In this study, a 3-dimensional grain burn-back analysis module is developed using the face offsetting method, which combines the advantages of the existing moving interface analysis methods to increase the accuracy and robustness. As a result, the face offsetting method is proved to be efficient for the grain burn-back analysis.

• 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 the Korean Society for Precision Engineering
• /
• v.23 no.7 s.184
• /
• pp.187-193
• /
• 2006

This paper introduces and illustrates the results of a new method for offsetting the triangular mesh generated from multiple surfaces. The meshes generated from each surface are separated each other and normal directions are different. The face normal vectors are flipped to upward and the lower faces covered by upper faces are deleted. The virtual normal vectors are introduced and used to of feet boundary. It was shown that new method is better than previous methods in offsetting the triangular meshes generated from multiple surfaces. The introduced offset method was applied for 3-axis tool path generation system and tested by NC machining.

• Korean Journal of Computational Design and Engineering
• /
• v.5 no.3
• /
• pp.242-254
• /
• 2000

This paper describes an efficient solid modeling method for thin-walled plastic or sheet metal parts, based on the non-manifold offsetting operations. Since the previous methods for modeling and converting a sheet into a solid have adopted the boundary representations for solid object as their topological framework, it is difficult to represent the exact adjacency relationship between topological entities of a sheet model and a mixture of wireframe and sheet models that can appear in the meantime of modeling procedure, and it is hard to implement topological operations for sheet modeling and transformation of a sheet into a solid. To solve these problems, we introduce a non-manifold B-rep and propose a sheet conversion method based on a non-manifold offset algorithm. Because the non-manifold offset aigorithm based on mathematical definitions results in an offset solid with tubular and spherical thickness-faces we modify it to generate the ruled or planar thickness-faces that are mostly shown in actual plastic or sheet metal parts. In addition, in order to accelerate the Boolean operations used the offset algorithm, we also develope an efficient face-face intersection algorithm using topological adjacency information.