Abstract：Let S be a finite planar point set in general position. S can be partitioned into convex cells, such that the union of the cells forms a simple polygon P, and every point of S is on the boundary of P, such empty convex k-subset of P is called a k-cell. Let f(S) be the minimum number of cells obtained in such a partition of S. F(n)=max{f(S):S is a n-point planar set in general position}. The lower bound of F(n) is improved to n+14 .
收稿日期: 2003-04-25
引用本文:
徐常青,苑立平. 关于平面点集的凸分解[J]. , 2003, 42(4): 0-0.
徐常青,苑立平. On convex decompositions of points in the plane. , 2003, 42(4): 0-0.
