Delaunay Triangulation Dividing Optimal Algorithm with Constraint Line

To improve performance of Delaunay triangulation dividing with constraint line,the paper gives the following method: (1)To generate Delaunay triangulation grid without constrain by parallel algorithm;(2)To insert new points by getting intersection point of circle defined by the triangulation's three vertices and constraint line. The parallel algorithm executes with higher performance. Considering affecting region of the constraint line and edge conditions of Delaunay triangulation rule, the "intersection point" inserting algorithm makes points which need inserted the fewest and affects less, on basis of satisfying overall Delaunay triangulation characteristic.