Disk covering problem

From Wikipedia, the free encyclopedia

You have new messages (last change).

The disk covering problem was proposed by Zahn in 1962.

Given an integer n, the problem asks for the smallest real number r(n) such that n disks of radius r(n) can be arranged in such a way as to cover the unit disk.

[edit] External links

 This mathematics-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../d/i/s/Disk_covering_problem.html"