Skip to main content
Conference ProceedingsOPEN ACCESS

Computing the diameter of a point set

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2002) 2301 197-208
DOI: 10.1007/3-540-45986-3_18
10Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Given a finite set of points P in ℝd, the diameter of P is defined as the maximum distance between two points of 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.

Cite

CITATION STYLE

APA

Malandain, G., & Boissonnat, J. D. (2002). Computing the diameter of a point set. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2301, pp. 197–208). Springer Verlag. https://doi.org/10.1007/3-540-45986-3_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free