A Novel Model of Conforming Delaunay Triangulation for Sensor Network Configuration

Algorithm 3

Step  1. Find the triangle or quadrangle □ which includes in the triangle marked by .

Step  2. Search the triangles whose circumcircle contains iteratively, construct the influence

   polygons of named , and judge whether is contained in a triangle by the sign of area coordinates.

Step  3. If the sharing edge of two triangles in is the feature segment having been treated,

   take this edge out of , and push it into .

Step  4. Connect with the vertexes of the influence polygons for constructing new triangles.

   Replace the triangle recorded in , then add the remainder of new triangles to the tail of the triangle array.

Step  5. Update

 Step  5-1. ;

 Step  5-2. If , where and are two neighbor vertexes of influence polygons of )

 Step  5-3. If , add to the head of .

Else

 Step  5-4. , add to the tail of .

Step  6. Update topology relationship of triangles by the method in [18].