Disjoint empty convex polygons in planar point sets (Q5945676)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1657366
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Disjoint empty convex polygons in planar point sets |
scientific article; zbMATH DE number 1657366 |
Statements
Disjoint empty convex polygons in planar point sets (English)
0 references
21 August 2002
0 references
convex polygons in planar sets
0 references
0.95768166
0 references
0.95768166
0 references
0.9557828
0 references
0.9377809
0 references
0.92586243
0 references
0.92586243
0 references
0.9240792
0 references
0.91938734
0 references
Let \(S\) be a set of \(n\) points in the plane, no three of which are collinear. A convex polygon whose vertices belong to \(S\) is an empty convex polygon if its interior is disjoint from \(S\). It is known that any set \(S\) admits \(\left[n\over 5\right]\) disjoint empty convex quadrangles. NEWLINENEWLINENEWLINEThe authors improve this lower bound by replacing \(\left[n\over 5\right]\) with \(\left[2n \over 9\right]\). This new bound is tight for \(n\leq 21\).
0 references
