A note on convex decompositions of a set of points in the plane (Q1889830): Difference between revisions

A set \(\Pi\) of convex polygons is called a convex decomposition of a set \(P\) of points in the Euclidean plane in general position if (i) the vertices of the polygons are in \(P\), (ii) the interiors of the polygons are pairwise disjoint, (iii) the union of \(\Pi\) is the convex hull of \(P\), and (iv) no point of \(P\) lies in the interior of any polygon in \(\Pi\). The authors prove by induction the following upper bound: For each set \(P\) of \(n \geq 3\) points in general position there is a convex decomposition \(\Pi\) of \(P\) with at most \((10n-18)/7\) polygons.