Place some points on a disc (or sphere) so that all distances between points are distinct. This occurs with probability 1 for randomly placed points.
Next make the distinct distances as distinct as possible: maximize the minimum difference among all pairs of distances.
Perhaps instead considering all distances, consider only the edges of the Delaunay triangulation.
Inspired by Golomb rulers on a line segment, dropping the requirement of integral distances. Any practical applications?
No comments :
Post a Comment