Skip to Main content Skip to Navigation
Reports

Computing the Diameter of a Point Set

Grégoire Malandain 1 Jean-Daniel Boissonnat 2
1 EPIDAURE - Medical imaging and robotics
CRISAM - Inria Sophia Antipolis - Méditerranée
2 PRISME - Geometry, Algorithms and Robotics
CRISAM - Inria Sophia Antipolis - Méditerranée
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.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00072354
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, May 23, 2006 - 8:30:34 PM
Last modification on : Friday, November 16, 2018 - 4:20:20 PM
Long-term archiving on: : Sunday, April 4, 2010 - 8:39:51 PM

Identifiers

  • HAL Id : inria-00072354, version 1

Collections

Citation

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

Share

Metrics

Record views

247

Files downloads

5154