Better approximation algorithm for point-set diameter

10/27/2018

∙

by   Mahdi Imanparast, et al.

∙

0

∙

share

We propose a new (1+O(ε))-approximation algorithm with O(n+ 1/ε^(d-1)/2) running time for computing the diameter of a set of n points in the d-dimensional Euclidean space for a fixed dimension d, where 0 < ε≤ 1. This result provides some improvements in the running time of this problem in comparison with previous algorithms.