15th International Meshing Roundtable
Birmingham, Alabama, U.S.A.
September 17-20, 2006
Department of Computer Science, Universidad de Chile
The Delaunay terminal edge algorithm for triangulation improvement proceeds by iterative Lepp selection of a point M which is midpoint of a Delaunay terminal edge in the mesh. The longest edge bisection of the associated terminal triangles (sharing the terminal edge) can be seen as a first step in the Delaunay insertion of M. The method was introduced as a generalization of non-Delaunay longest edge algorithms but formal termination proof had not been stated until now. In this paper termination is proved and several geometric aspects of the algorithm behavior are studied.
Download Full Paper (PDF Format)
Contact author(s) or publisher for availability and copyright information on above referenced article