Computing the Diameter of a Point Set - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles International Journal of Computational Geometry and Applications Year : 2002

Computing the Diameter of a Point Set

Abstract

Given a finite set of points ¸al P in ℝd, the diameter of ¸al P is defined as the maximum distance between two points of ¸al 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, 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-Peled and derive hybrid algorithms to combine advantages of both approaches.
Fichier principal
Vignette du fichier
malandain-ijcga-2002.pdf (614.22 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00615026 , version 1 (17-08-2011)

Identifiers

  • HAL Id : inria-00615026 , version 1

Cite

Grégoire Malandain, Jean-Daniel Boissonnat. Computing the Diameter of a Point Set. International Journal of Computational Geometry and Applications, 2002, 12 (6), pp.489--510. ⟨inria-00615026⟩
163 View
1148 Download

Share

Gmail Facebook X LinkedIn More