On computing the diameter of a point set in high dimensional Euclidean space
Authors:
- Daniele V. FinocchiaroDFDaniele V. Finocchiaro
- Marco PellegriniMPMarco Pellegrini
- 28 September 2002
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 287 (2) , 501-514
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Subquadratic approximation algorithms for clustering problems in high dimensional spaces1999
- Syntactic clustering of the WebComputer Networks and ISDN Systems, 1997
- Diameter, width, closest line pair, and parametric searchingDiscrete & Computational Geometry, 1993
- Applications of random sampling in computational geometry, IIDiscrete & Computational Geometry, 1989
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- Approximating the diameter of a set of points in the Euclidean spaceInformation Processing Letters, 1989
- Matrix multiplication via arithmetic progressions1987
- A survey of heuristics for the weighted matching problemNetworks, 1983
- Central Limit Theorems for Empirical MeasuresThe Annals of Probability, 1978
- On Sets of Distances of n PointsThe American Mathematical Monthly, 1946