On distinct distances from a vertex of a convex polygon
type: Item
instance of: scholarly article
title: On distinct distances from a vertex of a convex polygon
zbMATH Open document ID: 1109.52012
author: Adrian Dumitrescu
published in: Discrete \& Computational Geometry
publication date: 2006-12-06T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 52C10
zbMATH DE Number: 5077623
MaRDI profile type: Publication
full work available at URL: s00454-006-1262-y
OpenAlex ID: W2040885117
DOI: 10.1007/S00454-006-1262-Y
description: scientific article; zbMATH DE number 5077623