Finding sets of points without empty convex 6-gons (Q1864134)
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 1883360
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding sets of points without empty convex 6-gons |
scientific article; zbMATH DE number 1883360 |
Statements
Finding sets of points without empty convex 6-gons (English)
0 references
17 March 2003
0 references
The author investigates a problem posed by Erdős which asks whether every large enough set of points in general position in the plane contains six points that form a convex \(6\)-gon without any points from the set in its interior. The author presents a fast incremental algorithm with which he was able to find a set of \(29\) points in the plane in general position which does not contain empty \(6\)-gons. In addition, using results obtained by the algorithm, a number of observations and conjectures are formulated about the possible structure of sets of points without empty convex \(6\)-gons.
0 references
convex hull
0 references
empty convex \(6\)-gons
0 references
Erdős problems
0 references
incremental algorithm
0 references
0.8963208794593811
0 references
0.8700369596481323
0 references
0.8598206639289856
0 references
0.852853000164032
0 references
0.8418695330619812
0 references
