inria-00072354, version 1
Computing the Diameter of a Point Set
Grégoire Malandain
1Jean-Daniel Boissonnat 2
N° RR-4233 (2001)
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.
- 1: EPIDAURE (INRIA Sophia Antipolis)
- INRIA
- 2: PRISME (INRIA Sophia Antipolis)
- INRIA
- Domain : Computer Science/Other
- Keywords : COMPUTATIONAL GEOMETRY / DIAMETER
- Internal note : RR-4233
- inria-00072354, version 1
- http://hal.inria.fr/inria-00072354
- oai:hal.inria.fr:inria-00072354
- From: Rapport De Recherche Inria
- Submitted on: Tuesday, 23 May 2006 20:30:34
- Updated on: Wednesday, 31 May 2006 14:24:26
Associated documents
Export