On a partition into convex polygons (Q1917247): Difference between revisions

A set \(P\) of \(n\) points in the Euclidean plane may be partitioned into subsets such that the convex hulls of all subsets are disjoint. The minimum number of such subsets is called \(f(P)\), and \(F(n)\) is defined to be the maximum of \(f(P)\) over \(P\). Upper and lower estimates are established for \(F(n)\) and similarly defined numbers.