Covering the 5-dimensional unit cube by eight congruent balls
From MaRDI portal
(Redirected from Publication:1669685)
\textit{P. Brass} et al. [Research problems in discrete geometry. New York, NY: Springer (2005; Zbl 1086.52001)] listed the problem of covering the \(d\)-dimensional unit cube with \(n\) congruent balls of the smallest possible radius. The paper under review answers the \(d=5\), \(n=8\) instance of the problem, showing that the smallest possible radius is \(\sqrt{2/3}\).
Recommendations
Cites work
- Covering a ball with smaller equal balls in R^n
- Covering a rectangle with equal circles
- Covering a sphere with spheres
- Covering the k-skeleton of the 3-dimensional unit cube by five balls
- Covering the k-skeleton of the 3-dimensional unit cube by six balls
- Covering the crosspolytope by equal balls
- Covering the unit cube by equal balls
- Über einige dünnste Kreisüberdeckungen konvexer Bereiche durch endliche Anzahl von kongruenten Kreisen
Cited in
(4)
This page was built for publication: Covering the 5-dimensional unit cube by eight congruent balls
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1669685)
