On distinct distances from a vertex of a convex polygon (Q854704)
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 5077623
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On distinct distances from a vertex of a convex polygon |
scientific article; zbMATH DE number 5077623 |
Statements
On distinct distances from a vertex of a convex polygon (English)
0 references
6 December 2006
0 references
Given a set \(P\) of \(n\) points in convex position in the plane (i.e. the points are the vertices of a convex polygon), the author proves that there exists a point \(p \in P\) such that the number of distinct distances from \(p\) is at least \(\lceil(13n-6)/36\rceil\). The best previous bound, \(\lceil n/3\rceil\), from 1952, is due to Moser.
0 references
0.9920843243598938
0 references
0.9113930463790894
0 references
0.8448712825775146
0 references
0.8214880228042603
0 references
