Covering an ellipsoid with equal balls

Authors:
Ilya Dumer
Affiliations:
College of Engineering, University of California, Riverside, CA
Venue:
Journal of Combinatorial Theory Series A - Special issue in honor of Jacobus H. van Lint
Year:
2006

Citing 3
Cited 0

Sphere-packings, lattices, and groups

Sphere-packings, lattices, and groups
Covering a Ball with Smaller Equal Balls in ℝn

Discrete & Computational Geometry
On coverings of ellipsoids in Euclidean spaces

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

The thinnest coverings of ellipsoids are studied in the Euclidean spaces of an arbitrary dimension n. Given any ellipsoid, our goal is to find the minimum number of unit balls needed to cover this ellipsoid. A tight asymptotic bound on the logarithm of this number is obtained.