On computing the diameter of a point set in high dimensional Euclidean space

Theoretical Computer Science

Volumn 287, Issue 2, 2002, Pages 501-514

  Finocchiaro, Daniele V ^a   Pellegrini, Marco ^b,c  

^a SCUOLA NORMALE SUPERIORE   (Italy)

^b CNR   (Italy)

^c CNR Consiglio Nazionale delle Ricerche   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; DATABASE SYSTEMS; FUNCTIONS; PROBABILITY; PROBLEM SOLVING; SET THEORY;

IMAGE DATABASES;

COMPUTATIONAL COMPLEXITY;

EID: 0037190367     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00258-4     Document Type: Conference Paper

References (38)

1. A survey of heuristics for the weighted matching problem
2. An efficient algorithm for the three-dimensional diameter problem
3. Learnability and the Vapnik-Chervonenkis dimension
4. Subquadratic approximation algorithms for clustering problems in high dimensional spaces
5. Syntactic clustering of the Web
6. Diameter, width, closest line pair, and parametric searching
7. Applications of random sampling in computational geometry, II
8. Matrix multiplication via arithmetic progressions
9. Central limit theorems for empirical measures
10. A course on empirical processes
11. Approximating the diameter of a set of points in the Euclidean space
12. On sets of distances of n points
13. On sets of distances of points in Euclidean spaces
14. Query by image and video content: The QBIC system
15. The Johnson-Lindenstrauss lemma and the sphericity of some graphs
16. Inner and outer j-radii of convex bodies in finite dimensional normed spaces
17. Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces
18. On the complexity of some basic problems in computational convexity: I. Containment problems
19. Guest editors' introduction: Content-based image retrieval systems
20. ε-nets and simplex range queries
21. Fast multiresolution image querying
22. Extensions of Lipschitz mappings into a Hilbert space
23. Two algorithms for nearest-neighbor search in high dimensions
24. A deterministic algorithm for the three-dimensional diameter problem
25. Pattern recognition
26. Construction of 1-d lower envelopes and applications
27. Sur un problème géometrique de P. Erdös
28. New techniques for some dynamic closest-point and farthest-point problems
29. On the uniform convergence of relative frequencies of events to their probabilities
30. On constructing minimum spanning trees in k-dimensional spaces and related problems