Proof. Denote by f (n) the maximum number of times the unit distance can occur among n points in convex position in the plane. Let p 1 , p 2 , ..., p n , in this cyclic order, be the vertices of a convex polygon, for which the maximum is attained. Let G denote the geometric graph obtained by connect
✦ LIBER ✦
The maximum number of unit distances in a convex n-gon
✍ Scribed by Zoltȧn Füredi
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 216 KB
- Volume
- 55
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The Maximum Number of Times the Same Dis
✍
Peter Braß; János Pach
📂
Article
📅
2001
🏛
Elsevier Science
🌐
English
⚖ 70 KB
A lower bound on the number of unit dist
✍
Herbert Edelsbrunner; Péter Hajnal
📂
Article
📅
1991
🏛
Elsevier Science
🌐
English
⚖ 218 KB
On the Maximum Number of Touching Pairs
✍
Károly Bezdek
📂
Article
📅
2002
🏛
Elsevier Science
🌐
English
⚖ 102 KB
Minkowski space M d =(R d , || ||) is just R d with distances measured using a norm || ||. A norm || || is completely determined by its unit ball {x ¥ R d | ||x|| [ 1} which is a centrally symmetric convex body of the d-dimensional Euclidean space E d . In this note we give upper bounds for the maxi
The number of different distances determ
✍
F.R.K Chung
📂
Article
📅
1984
🏛
Elsevier Science
🌐
English
⚖ 494 KB
A note on the number of N-bit strings wi
✍
G.J. Chaitin
📂
Article
📅
1993
🏛
Elsevier Science
🌐
English
⚖ 187 KB
Maximum number of iterations in the tran
✍
Michel A. Simonnard; G. F. Hadley
📂
Article
📅
1959
🏛
John Wiley and Sons
🌐
English
⚖ 201 KB