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

In the process of finite element analysis, mesh generation is tedious job which consumes tremendous time. Therefore, the automation of well shaped mesh generation from the minimal boundary input data is desirable to improve reliability and accuracy of the analysis and also to reduce the process time of the entire design process. The automation of triangular mesh generation has been relatively well treated due to its robustness and ease of handling when compared to rectangular element mesh generation. In this study, the offset method developed previously for generating plane rectangular element mesh has been corrected and modified to generate triangular element mesh on the B-spline surface having arbitrary holes. The result shows that the generated triangular mesh has the average aspect ratio over 0.9. The designed arbitrary surface shape has been interactively constructed by non-uniform B-spline theory for triangular mesh generation.

• Korean Journal of Computational Design and Engineering
• /
• v.5 no.2
• /
• pp.144-154
• /
• 2000

We propose an algorithm for obtaining a triangular approximation of a trimmed NLRBS surface. Triangular approximation is used in the pre-processing step of many applications such as RP(Rapid Prototyping), NC(Numerical Control) and FEA(Finite Element Analysis), etc. The algorithm minimizes the number of triangular elements within tolerance and generates a valid triangular mesh for STL file and NC tool path generation. In the algorithm, a subdivision method is used. Since a patch is a basic element of triangular mesh creation, boundary curves of a patch are divided into line segments and the division of curves is applied for the interior of the surface. That is, boundary curves are subdivided into line segments and two end points of each line segment are propagated to the interior of the surface. For the case of a trimmed surface, triangulation is carried out using a model space information. The algorithm is superior because the number of elements can be controlled as the curvature of the surface varies and it generates the triangular mesh in a trimmed region efficiently. To verify the efficiency, the algorithm was implemented and tested for several 3D objects bounded by NURBS surfaces.

• Journal of KIISE
• /
• v.43 no.4
• /
• pp.419-429
• /
• 2016

Generating a 3D surface model from coronary artery segmentation helps to not only improve the rendering efficiency but also the diagnostic accuracy by providing physiological informations such as fractional flow reserve using computational fluid dynamics (CFD). This paper proposes a method to generate a triangular surface mesh using vessel structure information acquired with coronary artery segmentation. The marching cube algorithm is a typical method for generating a triangular surface mesh from a segmentation result as bit mask. But it is difficult for methods based on marching cube algorithm to express the lumen of thin, small and winding vessels because the algorithm only works in a three-dimensional (3D) discrete space. The proposed method generates a more accurate triangular surface mesh for each singular vessel using vessel centerlines, normal vectors and lumen diameters estimated during the process of coronary artery segmentation as the input. Then, the meshes that are overlapped due to branching are processed by mesh merging and merged into a coronary mesh.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.29 no.6 s.237
• /
• pp.895-903
• /
• 2005

In this paper, we present a cutter location (CL) surface deformation approach for constant scallop height tool path generation from triangular mesh. The triangular mesh model of the stereo lithography (STL) format is offset to the CL surface and then deformed in accordance with the deformation vectors, which are computed by the slope and the curvature of the CL surface. In addition, the tool path which is computed by slicing the deformed CL surface is inversely deformed by those same deformation vectors to a tool path with a constant scallop height. The proposed method is implemented, and a tool path generated by the proposed method is tested by simulation and by numerical control (NC) machining. The scallop height was found to be constant over the entire machined surface, demonstrating much better quality than that of mesh slicing, under the same constraints for machining time.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.2
• /
• pp.79-86
• /
• 1999

A general approach to automatic generation of triangular meshes on three-dimensional surfaces is presented in this paper. The approach, developed with emphasis on program generality and interface with CAD/CAM systems, is based on the double mapping method and the looping method. The double mapping method is introduced and anew splitting scheme is proposed for the looping method employed for triangular mesh generation on the parametric domain. Several application examples are given.

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

A new quadrilateral mesh generation technique from an existing triangle mesh is proposed in this paper. The proposed method is based on advancing front method and zero-thickness layer. Beginning with an initial triangular mesh, boundary triangular elements are removed and quadrilateral elements with zero thickness are generated. A quality of quadrilateral elements is improved during a mesh smoothing process. Until all initial triangular elements are removed, this procedure is repeated. Sample meshes are constructed to demonstrate the mesh generation capability of proposed algorithm.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1994.10a
• /
• pp.719-724
• /
• 1994

This paper describes a hybrid surface-based method for smooth 3D surface approximation to a sequence of 2D cross sections. The resulting surface is a hybrid G $^{1}$ surface represented by a mesh of triangular and rectangular Bezier patches defined on skinning, branching, or capping regions. Each skinning region is approximated with a closed B_spline surface, which is transformed into a mesh of Bezier patches. Triangular G $^{1}$ surfaces are constructed over brabching and capping regions such that the transitions between each capping regions such that the transitions between each triangular surface and its neighboring skinning surfaces are G $^{1}$ continuous. Since each skinning region is represented by an approximated rectangular C $^{2}$ suface instead of an interpolated trctangular G $^{[-1000]}$ surface, the proposed method can provide more smooth surfaces and realize more efficient data reduction than triangular surfacebased method.

• Korean Journal of Computational Design and Engineering
• /
• v.14 no.1
• /
• pp.33-41
• /
• 2009

Triangular mesh models are widely used in reverse engineering, computer graphics, rapid prototyping and NC(numerical controller) tool-path generation. Triangular mesh models are generated from point clouds, surface models and solid models. A halfedge-based triangular mesh data structure is proposed and the development considerations are presented. In the presented data structure, halfedge is the key data structure. Halfedge stores its triangle index and the order in the triangle. Triangles do not store the halfedge lists explicitly. Halfedge is referred by value and defined when it is required. Proposed data structure supports four design requirements: efficient rendering, compact memory, supporting efficient algorithms and easy programming.

• Journal of the Korean Society for Precision Engineering
• /
• v.26 no.1
• /
• pp.63-70
• /
• 2009

Proposed in the paper is an algorithm to generate tool-path for sculptured surface machining. The proposed algorithm computes tool path by slicing offset triangular mesh, which is the CL-surface (Cutter Location surface). Since the offset triangular mesh includes invalid triangles and self-intersections, it is necessary to remove invalid portions. For the efficient removal of the invalid portions, we extended the sweep line algorithm. The extended sweep line algorithm removes invalid portions very efficiently, and it also considers various degeneracy cases including multiple intersections and overlaps. The proposed algorithm has been implemented and tested with various examples.

• 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