摘要
Boundary recovery is one of the main obstacles in applying the Delaunay criterion to mesh generation. A stan- dard resolution is to add Steiner points directly at the intersection positions between missing boundaries and triangulations. We redesign the algorithm with the aid of some new concepts, data structures and operations, which make its implementation routine. Furthermore, all possible intersection cases and their solutions are presented, some of which are seldom discussed in the litera- ture. Finally, numerical results are presented to evaluate the performance of the new algorithm.
Boundary recovery is one of the main obstacles in applying the Delaunay criterion to mesh generation. A standard resolution is to add Steiner points directly at the intersection positions between missing boundaries and triangulations. We redesign the algorithm with the aid of some new concepts, data structures and operations, which make its implementation routine Furthermore, all possible intersection cases and their solutions are presented, some of which are seldom discussed in the literature. Finally, numerical results are presented to evaluate the performance of the new algorithm.
基金
Project (No. 60225009) supported by the National Natural ScienceFoundation of China through the National Science Fund for Distin-guished Young Scholars
