Computing the Diameter of a Point Set
Abstract
Given a finite set of points $\cal P$ in $\mathbb{R}^d$, the diameter of $\cal P$ is defined as the maximum distance between two points of $\cal P$. We propose a very simple algorithm to compute the diameter of a finite set of points. Although the algorithm is not worst-case optimal, it appears to be extremely fast for a large variety of point distributions.