Point sets with distinct distances

DOI10.1007/BF01299744zbMATH Open0847.52016MaRDI QIDQ1900187FDOQ1900187

Authors: Hanno Lefmann, Torsten Thiele 

Publication date: 8 October 1996

Published in: Combinatorica (Search for Journal in Brave)

Recommendations

• A note on distinct distance subsets
• On the distinct distances determined by a planar point set
• Distinct distances determined by subsets of a point set in space
• Distinct distances in homogeneous sets

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)

Cites Work

• Title not available (Why is that?)
• Repeated angles in the plane and related problems
• Combinatorial complexity bounds for arrangements of curves and spheres
• Extremal uncrowded hypergraphs
• Distinct distances determined by subsets of a point set in space
• A fast and simple randomized parallel algorithm for the maximal independent set problem
• On some problems of elementary and combinatorial geometry
• Unsolved problems in number theory
• The maximum number of unit distances in a convex \(n\)-gon
• Title not available (Why is that?)
• Bounds for arrays of dots with distinct slopes or lengths
• Title not available (Why is that?)
• An application of graph theory to additive number theory

Cited In (29)

• Three paths to point placement
• The grid revisited
• Distinct distances between lattice points
• On finding maximum-cardinality symmetric subsets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Distinct volume subsets
• Uniform dilations
• On the distinct distances determined by a planar point set
• On distinct distances and \(\lambda \)-free point sets
• A note on distinct distance subsets
• On distinct distances among points in general position and other related problems
• Distinct distances in homogeneous sets
• Maximal sets of given diameter in the grid and the torus
• Extreme Distances in Multicolored Point Sets
• Distinct angle problems and variants
• Selecting a subset of diverse points based on the squared Euclidean distance
• Problems on Two-Dimensional Synchronization Patterns
• On distinct sums and distinct distances.
• WHICH POINT CONFIGURATIONS ARE DETERMINED BY THE DISTRIBUTION OF THEIR PAIRWISE DISTANCES?
• Title not available (Why is that?)
• Bounds for arrays of dots with distinct slopes or lengths
• Distinct angles in general position
• Distinct distances in planar point sets with forbidden 4-point patterns
• An improved lower bound for general position subset selection
• Circle grids and bipartite graphs of distances
• Sets of points with pairwise distinct slopes
• Title not available (Why is that?)
• Incidences between points and generalized spheres over finite fields and related problems

This page was built for publication: Point sets with distinct distances

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900187)