The authors discuss the partition of a finite set of points in the plane into empty convex polygons, and improve some upper bound and lower bound in the related enumeration problems.
基金Project supported by the Natural Science Foundation of Hebei Province (No.19971).
文摘The authors discuss the partition of a finite set of points in the plane into empty convex polygons, and improve some upper bound and lower bound in the related enumeration problems.
