Abstract: According to the simple polygon structure problems of the discrete point set, the article proposes a kind of the Voronoi diagram(V diagram) incremental constructing algorithm. First of all, the adjacent relation between vertices is determined according to Voronoi graph of initial vertices; then the vertex set is divided to different region for determining the initial quadrilateral. Regional point is iteratively inserted into the initial quadrilateral to structure simple polygon, combining the adjacent relation between vertices with the rule of minimal perimeter increment. The theoretical analysis shows that the time complexity of this algorithm is Onlog(n), where n is the number of vertices.