A lower bound on the number of unit distances between the vertices of a convex polygon
From MaRDI portal
Publication:1174151
DOI10.1016/0097-3165(91)90042-FzbMATH Open0760.52001OpenAlexW1998206124MaRDI QIDQ1174151FDOQ1174151
Herbert Edelsbrunner, Péter Hajnal
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
Recommendations
Cites Work
Cited In (18)
- The maximum number of times the same distance can occur among the vertices of a convex \(n\)-gon is \(O(n\log n)\)
- Intervertex distances in convex polygons
- The unit distance problem for centrally symmetric convex polygons
- Computational Geometry Column 34
- On distinct distances from a vertex of a convex polygon
- The maximum number of unit distances in a convex \(n\)-gon
- On the chromatic number of subsets of the Euclidean plane
- The Sum of Distances Between Vertices of a Convex Polygon with Unit Perimeter
- A postscript on distances in convex \(n\)-gons
- Turán problems for edge-ordered graphs
- Title not available (Why is that?)
- Multiplicities of interpoint distances in finite planar sets
- On unit distances in a convex polygon
- Lower bounds for the number of small convex \(k\)-holes
- On locally Gabriel geometric graphs
- On the number of occurrences of the \(k\)th smallest distance between points in convex position
- Unit distances between vertices of a convex polygon
- Small distances in convex polygons
This page was built for publication: A lower bound on the number of unit distances between the vertices of a convex polygon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1174151)