A postscript on distances in convex \(n\)-gons (Q1314446)
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: A postscript on distances in convex \(n\)-gons |
scientific article; zbMATH DE number 502911
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A postscript on distances in convex \(n\)-gons |
scientific article; zbMATH DE number 502911 |
Statements
A postscript on distances in convex \(n\)-gons (English)
0 references
16 February 1994
0 references
Denote by \(g(n)\) the largest \(k\) such that every convex polygon with \(n\) vertices has a vertex \(x\) for which the next \(k\) vertices clockwise from \(x\) or the next \(k\) vertices counterclockwise from \(x\) are successively farther from \(x\). The authors prove that \(g(n) = [n/3] + 1\) for \(n \geq 4\).
0 references
distance
0 references
convex polygon
0 references
0 references
0.87646455
0 references
0.87621456
0 references
0.87621456
0 references
