| HAL-Inria | Publications, software ... of Inria's scientists |
Journal articles
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.
Cited literature [11 references]
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
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)