How to distribute k points inside a disc so to minimize the distance of any point inside the disc to the closest of the k points? Does this problem have a name? Is the solution a famous sequence of geometric graphs?
Take the 2minute tour
×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

This is the (finite) covering problem in the plane. According to Boroczky's book "Finite packing and covering", the answer is only known (provably) up to $k = 10$, due to the work of K. Bezdek and G. Fejes Toth. I don't know if the solutions are a famous sequence of geometric graphs.


