Improved Delaunay growing algorithms and application

An improved algorithm on the basis of growing algorithms is developed for highly-efficient establishment of Delaunay-triangulation. The algorithm makes use of a dynamic list of points. With the growth of the Delaunay-triangulation, the available points in the list decrease constantly, resulting in simplified calculation procedures. Moreover, the improved algorithm makes the triangle to grow from the last pressed edge in the edge table against the two possible edges of the conventional growing algorithms and ensures correct growth of the triangle. Earthwork calculation shows that the improved algorithm establishes Delaunay-triangulation faster than traditional algorithms.