Distinct distances in finite planar sets

DOI10.1016/S0012-365X(96)00145-8zbMath0894.52007OpenAlexW2036395616WikidataQ94701085 ScholiaQ94701085MaRDI QIDQ1377750

Paul Erdős, Peter C. Fishburn

Publication date: 7 September 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00145-8

zbMATH Keywords

Erdős problemsfinite planar point setsminimum number of different distances

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10)

Related Items

On 5-isosceles sets in the plane, with linear restriction ⋮ On a generalization of distance sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distinct distances determined by subsets of a point set in space
• Combinatorial complexity bounds for arrangements of curves and spheres
• Unsolved problems in geometry
• On some problems of elementary and combinatorial geometry
• Multiplicities of interpoint distances in finite planar sets
• Intervertex distances in convex polygons
• On Sets of Distances of n Points