A lower bound on the number of unit distances between the vertices of a convex polygon

DOI10.1016/0097-3165(91)90042-FzbMath0760.52001OpenAlexW1998206124MaRDI QIDQ1174151

Péter Hajnal, Herbert Edelsbrunner

Publication date: 25 June 1992

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(91)90042-f

zbMATH Keywords

convex polygonverticesnumber of unit distances

Mathematics Subject Classification ID

Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items

Multiplicities of interpoint distances in finite planar sets ⋮ Intervertex distances in convex polygons ⋮ Small distances in convex polygons ⋮ Turán problems for edge-ordered graphs ⋮ On the chromatic number of subsets of the Euclidean plane ⋮ On unit distances in a convex polygon ⋮ On locally Gabriel geometric graphs ⋮ Unit distances between vertices of a convex polygon ⋮ The maximum number of times the same distance can occur among the vertices of a convex \(n\)-gon is \(O(n\log n)\) ⋮ The maximum number of unit distances in a convex \(n\)-gon ⋮ Computational Geometry Column 34

Cites Work

• Unnamed Item
• Unnamed Item
• On Sets of Distances of n Points