Given a finite set of points in ℝd, the diameter of is defined as the maximum distance between two points of . We propose a very simple algorithm to compute the diameter of a finite set of points. Although the algorithm is not worst-case optimal, an extensive experimental study has shown that it is extremely fast for a large variety of point distributions. In addition, we propose a comparison with the recent approach of Har-Peled5 and derive hybrid algorithms to combine advantages of both approaches.
['Grégoire Malandain', 'Jean-Daniel Boissonnat']
COMPUTING THE DIAMETER OF A POINT SET