A Reliable and Effective Tetrahedral Meshing Algorithm
Shan Ju · Chinese Journal of Computers · 2007
A reliable and effective tetrahedral meshing algorithm is proposed based on advancing front method.The detailed design of the data structure is given which representing a mesh topology connection.The operators such as insert,query and delete like a database are implemented by using hash table which accelerates the whole algorithm.Instead of preparing a background mesh for mesh spacing control,this information is estimated at the beginning of each layer at each node from the area of connecting triangles on the front and a user-specified stretching factor.A Cell Searcher is prepared to correct the mesh spacing information and to perform geometric search efficiently.During rolling back the advancing path is changed by changing preferential factor of front,as a result the times of rolling back is decreased significantly.Node inserting based on linear programming technique guarantees the convergence of the algorithm.At the end of the mesh generation process,unwanted node removing and angle-based smoothing are employed to enhance the resulting mesh quality.The examples demonstrate that high quality tetrahedral meshes can be generated within a reasonable time limit.