A Delaunay refinement algorithm for quality 2-dimensional mesh generation
SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
Local bisection refinement for N-simplicial grids generated by reflection
SIAM Journal on Scientific Computing
Quality local refinement of tetrahedral meshes based on bisection
SIAM Journal on Scientific Computing
Construction of three-dimensional improved-quality triangulations using local transformations
SIAM Journal on Scientific Computing
Quality local refinement of tetrahedral meshes based on 8-subtetrahedron subdivision
Mathematics of Computation
Original article: A local refinement algorithm for the longest-edge trisection of triangle meshes
Mathematics and Computers in Simulation
Hi-index | 31.45 |
This paper presents an effective sliver-free and quality-improved local refinement algorithm of a tetrahedral mesh for an adaptive solution strategy. The method proposed is composed of controlled local refinement and a conventional quality improvement process. The new feature of the proposed method is the introduction of element-wise refinement switching between longest side bisection and octasection, to boost the quality improvement process of face swapping and node relaxation. Numerical results show that this refinement switching plays a critical role in improving the quality of poorly shaped elements while preserving the quality of well-shaped elements. The results also show that the proposed method is more effective than the previously known methods, considering both the average and minimum quality.