1 Answers
The disk covering problem asks for the smallest real number r {\displaystyle r} such that n {\displaystyle n} disks of radius r {\displaystyle r} can be arranged in such a way as to cover the unit disk. Dually, for a given radius ε, one wishes to find the smallest integer n such that n disks of radius ε can cover the unit disk.
The best solutions known to date are as follows.
4 views
Answered