Convex nonagons with five intervertex distances
✍ Scribed by Paul Erdös; Peter Fishburn
- Publisher
- Springer
- Year
- 1996
- Tongue
- English
- Weight
- 860 KB
- Volume
- 60
- Category
- Article
- ISSN
- 0046-5755
No coin nor oath required. For personal study only.
✦ Synopsis
The vertices of a convex planar nonagon determine exactly five distances if and only if they are nine vertices of a regular 10-gon or a regular 11-gon. This result has important ties to related concerns, including the maximum number of points in the plane that determine exactly five distances and, for each n > 7, the smallest t for which there exists a convex n-gon whose vertices determine t distances and are not all on one circle.
📜 SIMILAR VOLUMES
This paper investigates text entry on mobile devices using only five-keys. Primarily to support text entry on smaller devices than mobile phones, this method can also be used to maximise screen space on mobile phones. Reported combined Fitt's law and keystroke modelling predicts similar performance