Point sets with distinct distances

DOI10.1007/BF01299744zbMath0847.52016MaRDI QIDQ1900187

Torsten Thiele, Hanno Lefmann

Publication date: 8 October 1996

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

latticedistinct distancesefficient algorithmpoint sets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Erd?s problems and related topics of discrete geometry (52C10)

Related Items

Problems on Two-Dimensional Synchronization Patterns ⋮ Distinct angle problems and variants ⋮ A note on distinct distance subsets ⋮ Incidences between points and generalized spheres over finite fields and related problems ⋮ On distinct distances among points in general position and other related problems ⋮ Distinct Volume Subsets

Cites Work

• 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
• An application of graph theory to additive number theory
• Extremal uncrowded hypergraphs
• Repeated angles in the plane and related problems
• Bounds for arrays of dots with distinct slopes or lengths
• On some problems of elementary and combinatorial geometry
• The maximum number of unit distances in a convex \(n\)-gon
• A fast and simple randomized parallel algorithm for the maximal independent set problem
• Unsolved problems in number theory