On the empty convex partition of a finite set in the plane.
The authors discuss partitions of a finite set of points in the plane into empty convex polygons and into disjoint convex polygons. They improve upper and lower bounds in enumeration problems stated in [\textit{M. Urabe}, Discrete Appl. Math. 64, 179--191 (1996; Zbl 0849.52015)].
scientific article; zbMATH DE number 1877202