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

DOI10.1016/S0304-3975(01)00258-4zbMath1061.68166MaRDI QIDQ1853493

Marco Pellegrini, Daniele V. Finocchiaro

Publication date: 21 January 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Quantum speed-up for unsupervised learning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Diameter, width, closest line pair, and parametric searching
• Matrix multiplication via arithmetic progressions
• \(\epsilon\)-nets and simplex range queries
• The Johnson-Lindenstrauss lemma and the sphericity of some graphs
• Approximating the diameter of a set of points in the Euclidean space
• Inner and outer \(j\)-radii of convex bodies in finite-dimensional normed spaces
• Central limit theorems for empirical measures
• On the complexity of some basic problems in computational convexity. I. Containment problems
• Applications of random sampling in computational geometry. II
• Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces
• A survey of heuristics for the weighted matching problem
• Extensions of Lipschitz mappings into a Hilbert space
• Learnability and the Vapnik-Chervonenkis dimension
• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
• Printer graphics for clustering
• A deterministic algorithm for the three-dimensional diameter problem
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• On Sets of Distances of n Points
• Subquadratic approximation algorithms for clustering problems in high dimensional spaces

This page was built for publication: On computing the diameter of a point set in high dimensional Euclidean space.