Notice of Violation of IEEE Publication PrinciplesDynamic removal algorithm for constrained Delaunay triangulations

Notice of Violation of IEEE Publication Principles

"Dynamic Removal Algorithm for Constrained Delaunay Triangulations"
by Dong-Yu Xu, Guang-Rong Tang, and Yu-Pin Luo
in the Proceedings of the Third International Conference on Image and Graphics, 2004,

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

This paper contains significant portions of original text from the paper cited below. The original text was copied without attribution (including appropriate references to the original author(s) and/or paper title) and without permission.

Due to the nature of this violation, reasonable effort should be made to remove all past references to this paper, and future references should be made to the following article:

"Fully Dynamic Constrained Delaunay Triangulations"
by Marcelo Kallman, Hanspeter Bieri, and Daniel Thalmann
in Geometric Modelling for Scientific Visualization, G. Brunnett, B. Hamann, H.Mueller, L. Linsen (Eds.), Springer-Verlag, 2003, pp. 241-257Delaunay triangulations and constrained Delaunay triangulations are very popular tool used to analyze planar domain. An efficient removal algorithm is required when constructing the approximate skeleton of complicated dynamic planar domains. We present a fully dynamic algorithm for CDT. It inserts and removes constraints that maybe points or any kind of polygonal lines. Furthermore, the algorithm automatically detects and deals with the overlapping, self-intersections and duplicate of constraints.