Purpose During the industrial design process, a product is usually modified and analyzed repeatedly until reaching the final design. Modifying the model and regenerating a mesh for every update during this process is very time consuming. To improve efficiency, it is necessary to circumvent the computer-aided design modeling stage when possible and directly modify the meshes to save valuable time. The purpose of this paper is to develop a method for mesh modifications. Design/methodology/approach In contrast to existing studies, which focus on one or a class of modifications, this paper comprehensively studies mesh union, mesh gluing, mesh cutting and mesh partitioning. To improve the efficiency of the method, the paper presents a fast and effective surface mesh remeshing algorithm based on a ball-packing method and controls the remeshing regions with a size field. Findings Examples and results show that the proposed mesh modification method is efficient and effective. The proposed method can be also applied to meshes with different material properties, which is very different with previous work that is only suitable for the meshes with same material property. Originality/value This paper proposes an efficient and comprehensive tetrahedral mesh modification method, through which engineers can directly modify meshes instead of models and save time.

No abstract

Since meshes of poor quality give rise to low accuracy in finite element analysis and kinds of inconveniences in many other applications, mesh smoothing is widely used as an essential technique for the improvement of mesh quality. With respect to this issue, the main contribution of this paper is that a novel mesh smoothing method based on an exterior-angle-split process is proposed. The proposed method contains three main stages: the first stage is independent element geometric transformation performed by exterior-angle-split operations, treating elements unconnected; the second stage is to offset scaling and displacement induced by element transformation; the third stage is to determine the final positions of nodes with a weighted strategy. Theoretical proof describes the regularity of this method and many numerical experiments illustrate its convergence. Not only is this method applicable for triangular mesh, but also can be naturally extended to arbitrary polygonal surface mesh. Quality improvements of demonstrations on triangular and quadrilateral meshes show the effectiveness of this method.

No abstract

PurposeIntegrality of surface mesh is requisite for computational engineering. Nonwatertight meshes with holes can bring inconvenience to applications. Unlike simple modeling or visualization, the downstream industrial application scenarios put forward higher requirements for hole-filling, although many related algorithms have been developed. This study aims at the hole-filling issue in industrial application scenarios.Design/methodology/approachThis algorithm overcomes some inherent weakness of general methods and generates a high-level resulting mesh. Initially, the primitive hole boundary is filled with a more appropriate triangulation which introduces fewer geometric errors. And in order for better performances on shape approximation of the background mesh, the algorithm also refines the initial triangulation with topology optimization. When obtaining the background mesh defining the geometry and size field, spheres on it are packed to determine the vertex configuration and then the resulting high-level mesh is generated.FindingsThrough emphasizing geometry recovery and mesh quality, the proposed algorithm works well in hole-filling in industrial application scenarios. Many experimental results demonstrate the reliability and the performance of the algorithm. And the processed meshes are capable of being used for industrial simulation computations directly.Originality/valueThis paper makes input meshes more adaptable for solving programs through local modifications on meshes and perfects the preprocessing technology of finite element analysis (FEA).