论文部分内容阅读
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.