Computing the Diameter of a Point Set - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2001

Computing the Diameter of a Point Set

Grégoire Malandain
Jean-Daniel Boissonnat
  • Function : Author
  • PersonId : 830857

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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-4233.pdf (1.32 Mo) Télécharger le fichier

Dates and versions

inria-00072354 , version 1 (23-05-2006)

Identifiers

  • HAL Id : inria-00072354 , version 1

Cite

Grégoire Malandain, Jean-Daniel Boissonnat. Computing the Diameter of a Point Set. RR-4233, INRIA. 2001. ⟨inria-00072354⟩
90 View
4818 Download

Share

Gmail Mastodon Facebook X LinkedIn More