Covering a ball with smaller equal balls in \(\mathbb R^n\)

DOI10.1007/S00454-004-2916-2zbMath1066.52021OpenAlexW1965907328MaRDI QIDQ1764179

Jean-Louis Verger-Gaugry

Publication date: 23 February 2005

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-004-2916-2

zbMATH Keywords

coveringmetric geometryconvex geometry

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items (17)

On Locality-Sensitive Orderings and Their Applications ⋮ Gaussian random projections for Euclidean membership problems ⋮ Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs ⋮ On the covering index of convex bodies ⋮ Unnamed Item ⋮ Covering an ellipsoid with equal balls ⋮ Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs ⋮ Truly Optimal Euclidean Spanners ⋮ Covering the 5-dimensional unit cube by eight congruent balls ⋮ On the capacity of deep generative networks for approximating distributions ⋮ Spherical coverage verification ⋮ On Locality-Sensitive Orderings and Their Applications ⋮ Covering spheres with spheres ⋮ Dictionary descent in optimization ⋮ Is a finite intersection of balls covered by a finite union of balls in Euclidean spaces? ⋮ Convergence and concentration of empirical measures under Wasserstein distance in unbounded functional spaces ⋮ Covering a ball by smaller balls

This page was built for publication: Covering a ball with smaller equal balls in \(\mathbb R^n\)