The maximum number of second smallest distances in finite planar sets

DOI10.1007/BF02187849zbMath0749.52012OpenAlexW2075551959MaRDI QIDQ1189287

Peter Brass

Publication date: 26 September 1992

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131202

zbMATH Keywords

linear optimizationunit distancespoint sets in the plane

Mathematics Subject Classification ID

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

Related Items (4)

On the Erdös-diameter of sets ⋮ Small distances in convex polygons ⋮ The shortest distance among points in general position. ⋮ The multiplicity of the two smallest distances among points

Cites Work

• On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
• Unit distances
• Combinatorial complexity bounds for arrangements of curves and spheres
• On large distances in planar sets
• A Problem of Leo Moser About Repeated Distances on the Sphere
• On Sets of Distances of n Points
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The maximum number of second smallest distances in finite planar sets