• 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

• Korean Journal of Computational Design and Engineering
• /
• v.9 no.1
• /
• pp.27-34
• /
• 2004

A tetrahedral mesh generation scheme using 3-D operators has been presented. The proposed scheme employs new 3-D operators such as rearranging and modified finishing operators in addition to the previous trimming, wedging, digging, splitting and finishing operators. These new operators have been introduced in order to increase the stability of mesh generation process. Check processings with surrounded element edges and faces have also been optimized by employing a searching algorithm. Sample meshes are constructed to demonstrate the mesh generating capability of the proposed algorithm.

• Journal of Radiation Protection and Research
• /
• v.41 no.4
• /
• pp.389-394
• /
• 2016

Background: Tetrahedral-mesh geometries can be used in the MCNP code, but the MCNP code accepts only the geometry in the Abaqus input file format; hence, the existing tetrahedral-mesh models first need to be converted to the Abacus input file format to be used in the MCNP code. In the present study, we developed a simple but useful computer program, TET2MCNP, for converting TetGen-generated tetrahedral-mesh models to the Abacus input file format. Materials and Methods: TET2MCNP is written in C++ and contains two components: one for converting a TetGen output file to the Abacus input file and the other for the reverse conversion process. The TET2MCP program also produces an MCNP input file. Further, the program provides some MCNP-specific functions: the maximum number of elements (i.e., tetrahedrons) per part can be limited, and the material density of each element can be transferred to the MCNP input file. Results and Discussion: To test the developed program, two tetrahedral-mesh models were generated using TetGen and converted to the Abaqus input file format using TET2MCNP. Subsequently, the converted files were used in the MCNP code to calculate the object- and organ-averaged absorbed dose in the sphere and phantom, respectively. The results show that the converted models provide, within statistical uncertainties, identical dose values to those obtained using the PHITS code, which uses the original tetrahedral-mesh models produced by the TetGen program. The results show that the developed program can successfully convert TetGen tetrahedral-mesh models to Abacus input files. Conclusion: In the present study, we have developed a computer program, TET2MCNP, which can be used to convert TetGen-generated tetrahedral-mesh models to the Abaqus input file format for use in the MCNP code. We believe this program will be used by many MCNP users for implementing complex tetrahedral-mesh models, including computational human phantoms, in the MCNP code.

• Journal of the Korean Society for Precision Engineering
• /
• v.21 no.3
• /
• pp.91-99
• /
• 2004

An unstructured tetrahedral mesh generation algorithm has been presented. In order to construct better meshes in interior region by using an advancing front technique, a connecting operator and a local finishing operator II have been developed in addition to the existing operators. Before applying digging operators that generate new nodes inside of a meshing region, a connecting operator is employed that uses existing nodes which satisfy certain conditions for producing well-conditioned elements. The local finishing operator II is introduced to terminate the meshing process more flexibly on remaining subregions. With these new operators, tetrahedral meshing process becomes more robust and good quality of meshes are constructed.

• 대한방사선방어학회:학술대회논문집
• /
• 2011.11a
• /
• pp.174-175
• /
• 2011

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.29 no.5 s.236
• /
• pp.671-679
• /
• 2005

A method of generation boundary layer mesh has been presented. This paper describes the generation of semi-unstructured prismatic/tetrahedral meshes for three-dimensional geometries with thin thickness. By of fretting of surface triangle elements prismatic/tetrahedral meshes are generated and using the node relocation method of this research intersected meshes can be efficiently improved. Finally tetrahedral meshes are automatically generated at the rest of the domain. Sample meshes are constructed to demonstrate the mesh generating capability of the proposed algorithm.

• Korean Journal of Computational Design and Engineering
• /
• v.8 no.1
• /
• pp.41-47
• /
• 2003

In this paper, a tetrahedral mesh generation algorithm which uses a grid based method for interior region and an advancing front method for outer surface region is proposed. In order to apply an advancing front method for outer region of an object, a new operator so called a hole operator has been developed to handle multiple shells. With this grid based approach in the interior region, more stable and uniform meshes can be constructed especially in the interior region.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.06a
• /
• pp.607-610
• /
• 2005

A remeshing algorithm using tetrahedral elements has been developed, which is adapted to the mesh density map constructed by a posteriori error estimation. In the finite element analyses of metal forging processes, numerical error increases as deformation proceeds due to severe distortion of elements. In order to reduce the numerical error, the desired mesh sizes in each region of the workpiece are calculated by a posteriori error estimation and the density map is constructed. Piecewise density functions are then constructed with the radial basis function in order to interpolate the discrete data of the density map. The sample mesh is constructed based on the point insertion technique which is adapted to the density function and the mesh size is controlled by moving and deleting nodes to obtain optimal distribution according to the mesh density function and the quality optimization function as well. After finishing the redistribution process of nodes, a tetrahedral mesh is constructed with the redistributed nodes, which is adapted to the density map and resulting in good mesh quality. A goodness and adaptability of the constructed mesh is verified with a testing measure. The proposed remeshing technique is applied to the finite element analyses of forging processes.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.9 s.180
• /
• pp.2397-2405
• /
• 2000

The remeshing is a method to replace a distorted mesh by a new mesh without interrupting the finite element calculation. The remeshing procedure in this paper refers to the rezoning, for which a sm oothing process is developed to alleviate the distortions of mesh. In the paper, an automatic finite element rezoning system with tetrahedral elements for large deformation analysis has been developed. Our smoothing process is composed of two steps, a surface smoothing and a volume smoothing. In the surface smoothing, checking the dihedral angle and projection on surface patch reduced the change of shape and nodes penetrating die. The constrained Laplacian smoothing has been employed for the volume smoothing process. The state variables are mapped from old mesh to new mesh by using volume coordinates within a tetrahedral element. All these procedures have been linked to the NIKE3D program As illustrated in the examples the overall strategy ensures a robust and efficient rezoning scheme for finite element simulation of metal-forming processes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.6
• /
• pp.667-681
• /
• 2009

We describe a method to decompose a cube with trilinear interpolation into a collection of tetrahedra with linear interpolation, where the isosurface topology is preserved for all isovalues during decomposition. Visualization algorithms that require input scalar data to be defined on a tetrahedral grid can utilize our method to process 3D rectilinear data with topological correctness. As one of many possible examples, we apply the decomposition method to topologically accurate tetrahedral mesh extraction of an interval volume from trilinear volumetric imaging data. The topological correctness of the resulting mesh can be critical for accurate simulation and visualization.