On a partition into convex polygons (Q1917247)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On a partition into convex polygons |
scientific article; zbMATH DE number 897361
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a partition into convex polygons |
scientific article; zbMATH DE number 897361 |
Statements
On a partition into convex polygons (English)
0 references
7 July 1996
0 references
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.
0 references
partitions
0 references
polygon
0 references
