The number of distinct distances from a vertex of a convex polygon
<p>Erdős conjectured in 1946 that every $n$-point set $P$ in convex position in the plane contains a point that determines at least $\lfloor n/2\rfloor$ distinct distances to the other points of $P$. The best known lower bound due to Dumitrescu (2006) is $13n/36 − O(1)$. In the present note, w...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Carleton University
2013-03-01
|
| Series: | Journal of Computational Geometry |
| Online Access: | http://jocg.org/index.php/jocg/article/view/103 |