Dissemin is shutting down on January 1st, 2025

Published in

Springer, Lecture Notes in Computer Science, p. 197-208, 2002

DOI: 10.1007/3-540-45986-3_18

World Scientific Publishing, International Journal of Computational Geometry and Applications, 06(12), p. 489-509

DOI: 10.1142/s0218195902001006

Links

Tools

Export citation

Search in Google Scholar

Computing the Diameter of a Point Set

Journal article published in 2001 by Grégoire Malandain ORCID, Jean-Daniel Boissonnat
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Red circle
Preprint: archiving forbidden
Orange circle
Postprint: archiving restricted
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

Abstract

Given a finite set of points [Formula: see text] in ℝd, the diameter of [Formula: see text] is defined as the maximum distance between two points of [Formula: see text]. 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.