Universal Point,Line and Polygon Delaunay Triangulation and Dynamic Editing

This paper summarizes and presents a kind of universal algorithm of generic points,lines and polygon Delaunay triangulation and dynamic editing.Discrete points,constrained line,polygon,polygon features with zone constraints(including point,line,polygon) Delaunay triangulation can be achieved.The outer boundary of Delaunay triangulation in general is the convex bumps of discrete points,and the inner islands generally do not dig out.The algorithm in process of the Delaunay triangulation,realized the inner and outer boundary processing.