We present a new simple approximation algorithm for computing the diameter of a point-set in d-dimensions. The new algorithm is sensitive to the ``hardness'' of computing the diameter of the given input, and for most inputs it is able to compute the exact diameter extremely fast. The algorithm can be implemented quickly, and it is robust. As such, this algorithm seems to be the algorithm of choice in practice for computing/approximating the diameter.
Bin Packing (7)