Notice of RetractionImproved algorithm for constrainted delaunay triangulation mesh generation

Notice of Retraction

After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.

We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.

The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.

The constrained Delaunay triangle algorithm has been researched thoroughly based on calculates geometry theory in the paper. In order to avoid degenerated phenomenon, five points of altogether the balls problem and the multi-spots co-plane problem causing the position error, the stochastic perturbation algorithm has been introduced into the algorithm. It can improve the quality of triangulable unit. A boundary restoring algorithm and sliver eliminating algorithm which is suit to all kinds of complex situation boundary is proposed. Based on boundary restoring and sliver elimination, the mesh quality can be improved by using the technology of local transform in contiguous segments and meshing slippery. At last, the Delaunay triangle algorithm, Boundary restoring algorithm and Sliver elimination algorithm are indicated to be efficient, general, high quality and easy to be realized in test experiments.