On a partition into convex polygons (Q1917247): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3864528 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Konvexe Fünfecke in ebenen Punktmengen / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sets with No Empty Convex 7-Gons / rank | |||
Normal rank | |||
Latest revision as of 13:08, 24 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a partition into convex polygons |
scientific article |
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
