The Maximum Number of Times the Same Distance Can Occur among the Vertices of a Convex n-gon Is O(n log n).
Peter BraßJános PachPublished in: J. Comb. Theory, Ser. A (2001)
Keyphrases
- maximum number
- distance measure
- distance function
- weighted graph
- piecewise linear
- lower bound
- convex optimization
- globally optimal
- distance matrix
- orders of magnitude
- convex programming
- hamming distance
- distance measurement
- data sets
- dissimilarity measure
- convex hull
- euclidean distance
- decision trees
- genetic algorithm