Abstract: 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.

Key words: Boundary recovery, Delaunay triangulation, Mesh generation, Data structure

Please provide your name, email address and a comment

Your Name: Affili: E-Mail Address:

Comment (Please comment in English):


Verification Code(click to change a pic):