On computing the diameter of a point set in high dimensional Euclidean space.
type: Item
instance of: scholarly article
title: On computing the diameter of a point set in high dimensional Euclidean space.
zbMATH Open document ID: 1061.68166
DOI: 10.1016/S0304-3975(01)00258-4
author: Daniele V. Finocchiaro
author: Marco Pellegrini
published in: Theoretical Computer Science
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 52B55
zbMATH DE Number: 1857034
MaRDI profile type: Publication
cites work: Q4004078
cites work: A survey of heuristics for the weighted matching problem
cites work: Q4250174
cites work: Learnability and the Vapnik-Chervonenkis dimension
cites work: Subquadratic approximation algorithms for clustering problems in high dimensional spaces
cites work: Diameter, width, closest line pair, and parametric searching
cites work: Applications of random sampling in computational geometry. II
cites work: Matrix multiplication via arithmetic progressions
cites work: Central limit theorems for empirical measures
cites work: Q3217346
cites work: Approximating the diameter of a set of points in the Euclidean space
cites work: On Sets of Distances of n Points
cites work: Q3270291
cites work: The Johnson-Lindenstrauss lemma and the sphericity of some graphs
cites work: Inner and outer \(j\)-radii of convex bodies in finite-dimensional normed spaces
cites work: Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces
cites work: On the complexity of some basic problems in computational convexity. I. Containment problems
cites work: Printer graphics for clustering
cites work: \(\epsilon\)-nets and simplex range queries
cites work: Extensions of Lipschitz mappings into a Hilbert space
cites work: Q4527027
cites work: Q4057549
cites work: A deterministic algorithm for the three-dimensional diameter problem
cites work: Q4856179
cites work: Q4401033
cites work: Q3992847
cites work: Q3241604
cites work: Q3138881
cites work: On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
cites work: Q4253255
cites work: On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
description: scientific article; zbMATH DE number 1857034