Skip to Main content Skip to Navigation
Journal articles

Computing the Diameter of a Point Set

Grégoire Malandain 1, * Jean-Daniel Boissonnat 2, * 
* Corresponding author
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 ¸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.
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/inria-00615026
Contributor : Project-Team Asclepios Connect in order to contact the contributor
Submitted on : Wednesday, August 17, 2011 - 11:15:10 PM
Last modification on : Friday, February 4, 2022 - 3:21:36 AM
Long-term archiving on: : Friday, November 25, 2011 - 11:26:15 AM

File

malandain-ijcga-2002.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00615026, version 1

Collections

Citation

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

Share

Metrics

Record views

123

Files downloads

862