Covering a regular pentagon with n equal discs · n = 31
Place the centres of n equal-radius discs in a regular pentagon so their union covers it completely, and minimise the shared radius.
Formal definition
- ContainerThe closed convex polygon with successive vertices (0.5,1), (0.024471742,0.654508497), (0.206107374,0.095491503), (0.793892626,0.095491503), and (0.975528258,0.654508497)
- SubmissionExactly n distinct points inside the container
- ScoreThe distance from the hardest-to-cover place to its nearest centre, determined exactly by finitely many rational Voronoi vertices
- ObjectiveMake the covering radius as small as possible